Date
Tue, 19 May 2009
Time
14:30 - 15:30
Location
L3
Speaker
Jozef Skokan
Organisation
LSE
For graphs L1,,Lk, the Ramsey number R(L1,,Lk) is the minimum integer N such that for any edge-colouring of the complete graph KN by k colours there exists a colour i for which the corresponding colour class contains Li as a subgraph.

In this talk, we shall discuss recent developments in the case when the graphs L1,,Lk are all cycles and k2.

Last updated on 6 May 2025, 2:04pm. Please contact us with feedback and comments about this page.