Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/ii/paper-1/17i/b/solution
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 1 17I b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
The Erdős-Stone theorem states that if the chromatic number of is , thenIf is a bipartite graph with at least one edge, its chromatic number is two, so and therefore
New to topics? Read the docs here!