Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, February 03, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Penny Haxell (Univ. of Waterloo)
The Ramsey number for a graph H is defined to be the smallest N such that every colouring of the edges of KN with two colours contains a monochromatic copy of H (i.e. one in which all edges have the same colour). A classical result from graph Ramsey theory states that (for n >= 5) the Ramsey number for the cycle with n vertices is 2n-1 if n is odd, and 3n/2-1 if n is even. Here we consider the same problem for 3-uniform hypergraph cycles, and obtain asymptotically best possible results.
Automatic MiSe System Software Version 1.4803M | admin login