Seminar series
Date
Tue, 19 May 2009
Time
14:30 -
15:30
Location
L3
Speaker
Jozef Skokan
Organisation
LSE
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$.
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$.