Canonical colourings in random graphs | Research seminar in Discrete Mathematics
Abstract Rdl and Rucinski have extended Ramseys Theorem to random graphs, showing that there is aconstant C' such that with high probability, any two-colouring of the edges of G(n, p) wi