TITLE: $K_6$ contains at least two monochromatic $K_3$ graphs.
QUESTION [8 upvotes]: Let $K_n$ be a complete $n$ graph with a color set $c$ with $c=\{\text{Red}, \text{Blue}\}$. Every edge of the complete $n$ graph is colored either $\text{Red}$ or $\text{Blue}$. Since $R(3, 3)=6$, the $K_6$ graph must contain at least one monochromatic $K_3$ graph. How can I prove that this graph must contain another (different) monochromatic $K_3$ graph. I saw proofs which uses the fact that there are at most $18$ non-monochromatic $K_3$ graphs. Since there are $20$ $K_3$ graphs (how can you calculate this) there are at least 2 monochromatic $K_3$ graphs. Are there other proofs?

REPLY [9 votes]: There is another counting argument that one can come up with. A possible quantity of interest is a $monochromatic$ $angle$. An angle is monochromatic if both its arms are of the same colour.
Using pigeonhole principle, we can see that, at each vertex of $K_6$, there are at least three edges of the same colour (and hence at least 4 monochromatic angles). This leads to the conclusion that there are at least $24$ $(=6$x$4)$ monochromatic angles in $K_6$. Also, we can see that every monochromatic triangle has $3$ monochromatic angles and every other triangle has exactly $1$ monochromatic angle.
We know that there are a total of $20$ triangles in $K_6$. Let there be $x$ monochromatic triangles. Then there must be $(20−x)$ non-monochromatic triangles.
Putting all of this together, we get:
$3x+(20−x)$$≥24$ which gives $x≥2$.
I really like this argument and feel that the idea of monochromatic angles is very understudied. There are more things one can prove using this quantity and I encourage you to do so :)