Colouring graphs without odd holes
Abstract
Gyárfás conjectured in 1985 that if $G$ is a graph with no induced cycle of odd length at least 5, then the chromatic number of $G$ is bounded by a function of its clique number. We prove this conjecture. Joint work with Paul Seymour.