A canonical Ramsey theorem for even cycles in random graphs

José D. Alvarado, Y. Kohayakawa, Patrick Morris +1

The celebrated canonical Ramsey theorem of Erdős and Rado implies that for $2\le k\in \mathbb{N}$, any colouring of the edges of $K_n$ with $n$ sufficiently large gives a copy of…