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