Journal title
Journal of Combinatorial Theory, Series B
DOI
10.1016/j.jctb.2019.05.001
Volume
140
Last updated
2020-07-01T16:16:35.93+01:00
Page
84-97
Abstract
We prove a conjecture of András Gyárfás, that for all k, ℓ, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.
Symplectic ID
982667
Submitted to ORA
On
Publication type
Journal Article
Publication date
16 May 2019