Multicolour Ramsey numbers for cycles

Multicolour Ramsey numbers for cycles

Tue, 19/05/2009
14:30 		Jozef Skokan (LSE) Combinatorial Theory Seminar Add to calendar L3
Multicolour Ramsey numbers for cycles
For graphs $ L_1,\dots,L_k $, the Ramsey number $ R(L_1,\ldots,L_k) $ is the minimum integer $ N $ such that for any edge-colouring of the complete graph $ K_N $ by $ k $ colours there exists a colour $ i $ for which the corresponding colour class contains $ L_i $ as a subgraph. In this talk, we shall discuss recent developments in the case when the graphs $ L_1,\dots,L_k $ are all cycles and $ k\ge2 $.