Journal title
Journal of Combinatorial Theory, Series B
DOI
10.1016/j.jctb.2019.05.001
Volume
140
Last updated
2024-04-11T01:56:39.38+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
912188
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
16 May 2019