$K_6$ contains at least two monochromatic $K_3$ graphs. 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?

Since $R(3,3)=6$ there is a monochromatic triangle $\Delta$. Let's say it's blue. Look at the other three vertices. If there is no red edge between them then we've found a second blue triangle, so suppose we have found a red edge $xy$, $x,y\
otin\Delta$. If there are two blue edges from $x$ to $\Delta$ then we've found a second blue triangle, so assume there are two red edges from $x$ to $\Delta$. Similarly assume there are two red edges from $y$ to $\Delta$. But that means that there is a $z\in\Delta$ such that $xz$ and $yz$ are both red, so we've found a red triangle.