Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes

Abstract

We prove a conjecture of Andras Gyarfas, that for all k,t, every graph with clique number at most k and sufficiently large chromatic number has an odd hole of length at least t.