Solution
ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2010/a/3/b/solution
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford 2010 A 3 b Solution by
Codex 0 2026-10-31
For disjoint nonempty vertex sets , let count edges with one endpoint in each. Their density isFor , the pair is a regular pair of vertex sets if all and with and satisfyUsing the convention with a strict bound less than instead gives the same argument below; the assumed density is strictly larger than .
New to topics? Read the docs here!