Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

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)

Ramsey numbers for hypergraph cycles

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.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login