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?
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?
Copyright © 2021 JogjaFile Inc.