Show that if $n \ge R(6,6)$ and we partition the edges of the complete graph $K_n$ into four pieces then one of the pieces contains a traingle.

20 Views Asked by At

Show that if $n \ge R(6,6)$ and we partition the edges of the complete graph $K_n$ into four pieces then one of the pieces contains a triangle.

How do I use the ramsey theorem to prove the above question?