Suppose that G is a graph with $\displaystyle n>r+1$ vertices and $\displaystyle t_r(n)+1$ edges. Prove that G contains two copies of $\displaystyle K_{r+1}$ with exactly r common vertices.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud