A note on local colorings of graphs Original Research Article

Recently, Rödl and Ruciński [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 - p. We write F → (G)r if for every r-coloring of the edges of F there is a monochromatic copy of G.