A sharp threshold for random graphs with a monochromatic triangle in every edge coloring

Ehud Friedgut, Vojtech Rodl, Andrzej Rucinski +1

Let $\mathbb{R}$ be the set of all finite graphs $G$ with the Ramsey property that every coloring of the edges of $G$ by two colors yields a monochromatic triangle. In this paper we establ…