dc.contributor.author | Chudnovsky, Maria | |
dc.contributor.author | Scott, Alex | |
dc.contributor.author | Seymour, Paul | |
dc.contributor.author | Spirkl, Sophie | |
dc.date.accessioned | 2022-08-12 01:09:24 (GMT) | |
dc.date.available | 2022-08-12 01:09:24 (GMT) | |
dc.date.issued | 2020-01 | |
dc.identifier.uri | https://doi.org/10.1016/j.jctb.2019.05.001 | |
dc.identifier.uri | http://hdl.handle.net/10012/18528 | |
dc.description | The 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.abstract | We 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.sponsorship | Supported 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.language.iso | en | en |
dc.publisher | Elsevier | en |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | induced subgraphs | en |
dc.subject | odd holes | en |
dc.title | Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes | en |
dc.type | Article | en |
dcterms.bibliographicCitation | Chudnovsky, 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.001 | en |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.contributor.affiliation2 | Combinatorics and Optimization | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Reviewed | en |
uws.scholarLevel | Faculty | en |