"Let G be a complete graph on 25 vertices and let the edges of G be colored either brown or green. If there is no green triangle, what is the largest complete brown sub-graph you can be sure G has?"
After some tedious pencil work I ended up with the answer that the largest brown clique in G has 7 vertices, is there any way to prove (or disprove) this by counting instead of drawing?
Thanks