Colouring graphs with no long holes
Maria Chudnovsky, Alex Scott · arXiv (Cornell University) · 2015
We prove a 1985 conjecture of Gyárfás that for all k, `, every graph with sufficiently large chromatic number contains either a clique of cardinality more than k or an induced cycle of length more than `. 1