+0  
 
0
3
104
1
avatar
What is the smallest n such that if you color the edges of a complete graph with n nodes either red or blue, there must be a monochromatic triangle?
 Mar 15, 2021
 #1
avatar
0

Ramsay Theory tells us that the answer is n = 8.

 Mar 15, 2021

12 Online Users

avatar