Abstract: The canonical Ramsey theorem of Erdős and Rado impliesthat for a given graph H, if n is sufficiently large then any colouring of the edges of K_n gives rise to copies of H that exhibit certain colour patterns, namely monochromatic, rainbow or lexicographic. I will discuss recent results on the threshold at which the random graph G(n,p) inherits the canonical Ramsey properties of K_n.
Comparte en: