Random Graphs with Monochromatic Triangles in Every Edge Coloring

We prove that for every r ⩾ 2 there is C > 0 such that if pCn−1/2 then almost surely every r-coloring of the edges of the binomial random graph K(n, p) results in a monochromatic triangle. © 1994 John Wiley & Sons, Inc.