Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 1 / 17I / b / Solution

The Erdős-Stone theorem states that if the chromatic number of $H$ is $r+1\ge 2$, thenIf $H$ is a bipartite graph with at least one edge, its chromatic number is two, so $r=1$ and therefore