Help please!!

Question

0

3

317

1

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?

Guest Mar 15, 2021

Guest · Answer 1 · 2021-03-15T11:19:32

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