Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Loading...
Date
2020-01
Authors
Chudnovsky, Maria
Scott, Alex
Seymour, Paul
Spirkl, Sophie
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
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 ℓ.
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/
Keywords
induced subgraphs, odd holes