On the Multi-coloured Ramsey Numbers of Cycles

Tomasz Łuczak, Miklós Simonovits, Jozef Skokan

For a graph $L$ and an integer $k\ge 2$, $R_k(L)$ denotes the smallest integer $N$ for which for any edge-colouring of the complete graph $K_N$ by $k$ colours there exists a colou…