Induced subgraphs of graphs with large chromatic number. III. Long holes

We prove a 1985 conjecture of Gy'arf'as that for all $k,\mathrm{\ell }$, every graph with sufficiently large chromatic number contains either a complete subgraph with $k$ vertices or an induced cycle of length at least $\mathrm{\ell }$.