In this talk we will present a result concerning the sudden emergence of Ramsey properties in a random graph as the parameter controlling the edge probability grows. An important ingredient in the proof, which is of interest in its own right, is a generalization of Szemeredi's regularity Lemma to a certain family of hypergraphs.