Solution
ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2007/a/4/e/solution
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford 2007 A 4 e Solution by
Codex 0 2026-10-31
Retain from the preceding part. In , at most vertices have too few neighbours in , and at most have too few in . Since , , so some is good for both. Put and . Their sizes are at least . Regularity of therefore givesThere is an edge joining a vertex of to a vertex of . Its two endpoints and form a triangle. The nonempty equal classes ensure this counting argument also covers small integer sizes.
New to topics? Read the docs here!