UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes

Simple item page
dc.contributor.authorChudnovsky, Maria
dc.contributor.authorScott, Alex
dc.contributor.authorSeymour, Paul
dc.contributor.authorSpirkl, Sophie
dc.date.accessioned2022-08-12T01:09:24Z
dc.date.available2022-08-12T01:09:24Z
dc.date.issued2020-01
dc.descriptionThe final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2019.05.001 © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.description.abstractWe prove a conjecture of András Gyárfás, that for all k, l, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.en
dc.description.sponsorshipSupported by NSF grant DMS-1550991 and US Army Research Office Grant W911NF-16-1-0404. Supported by ONR grant N00014-14-1-0084 and NSF grant DMS-1265563. Current address: Rutgers University, New Brunswick, NJ 08901, USA.en
dc.identifier.urihttps://doi.org/10.1016/j.jctb.2019.05.001
dc.identifier.urihttp://hdl.handle.net/10012/18528
dc.language.isoenen
dc.publisherElsevieren
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectinduced subgraphsen
dc.subjectodd holesen
dc.titleInduced subgraphs of graphs with large chromatic number. VIII. Long odd holesen
dc.typeArticleen
dcterms.bibliographicCitationChudnovsky, M., Scott, A., Seymour, P., & Spirkl, S. (2020). Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. Journal of Combinatorial Theory, Series B, 140, 84–97. https://doi.org/10.1016/j.jctb.2019.05.001en
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:
Induced with large chromatic.pdf
Size:
240.21 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Waterloo Research
Combinatorics and Optimization