Erdős–Hajnal for graphs with no 5-hole

Simple item page
dc.contributor.authorChudnovsky, Maria
dc.contributor.authorScott, Alex
dc.contributor.authorSeymour, Paul
dc.contributor.authorSpirkl, Sophie
dc.date.accessioned2023-02-21T19:54:05Z
dc.date.available2023-02-21T19:54:05Z
dc.date.issued2023-01-31
dc.description© 2023 The Authors. Proceedings of the London Mathematical Society is copyright © London Mathematical Society. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.en
dc.description.abstractThe Erdős–Hajnal conjecture says that for every graph H there exists t > 0 such that every graph G not containing H as an induced subgraph has a clique or stable set of cardinality at least IGIt. We prove that this is true when H is a cycle of length five. We also prove several further results: for instance, that if C is a cycle and H is the complement of a forest, there exists t > 0 such that every graph G containing neither of C,H as an induced subgraph has a clique or stable set of cardinality at least IGIt.en
dc.description.sponsorshipEPSRC, EP/V007327/1 || AFOSR, A9550-19-1-0187, FA9550-22-1-0234 || National Sciences and Engineering Research Council of Canada (NSERC), RGPIN-2020-03912 || NSF, DMS-1763817, DMS-2154169en
dc.identifier.urihttps://doi.org/10.1112/plms.12504
dc.identifier.urihttp://hdl.handle.net/10012/19179
dc.language.isoenen
dc.publisherWileyen
dc.relation.ispartofseriesProceedings of the London Mathematical Society;
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.titleErdős–Hajnal for graphs with no 5-holeen
dc.typeArticleen
dcterms.bibliographicCitationChudnovsky, M., Scott, A., Seymour, P., & Spirkl, S. (2023). Erdős–Hajnal for graphs with no 5‐hole. Proceedings of the London Mathematical Society. https://doi.org/10.1112/plms.12504en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Combinatorics and Optimizationen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Proceedings of London Math Soc - 2023 - Chudnovsky - Erd s Hajnal for graphs with no 5‐hole.pdf
Size:
232.09 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Waterloo Research