# Puzzle based on Turan's Theorem

Printable View

• October 30th 2010, 02:38 AM
Newtonian
Puzzle based on Turan's Theorem
Suppose that G is a graph with $n>r+1$ vertices and $t_r(n)+1$ edges. Prove that G contains two copies of $K_{r+1}$ with exactly r common vertices.