Solution

ID: 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 is , then
If is a bipartite graph with at least one edge, its chromatic number is two, so and therefore

New to topics? Read the docs here!