Paper 2, Section II, G
Define the Turán graph , where and are positive integers with . For which and is regular? For which and does contain as a subgraph?
State and prove Turán's theorem.
Let be unit vectors in the plane. Prove that the number of pairs for which has length less than 1 is at most .
Typos? Please submit corrections to this page on GitHub.