Solution

ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2010/a/3/b/solution

For disjoint nonempty vertex sets , let count edges with one endpoint in each. Their density is
For , the pair is a regular pair of vertex sets if all and with and satisfy
Using 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!