| Mittagsseminar Talk Information | |
Date and Time: Thursday, May 13, 2004, 12:15 pm Duration: This information is not available in the database Location: This information is not available in the database Speaker: Martin Marciniszyn Ramsey gamesConsider the following game on a random graph G=G(n,p): in the first
round the player has to colour the edges of G avoiding a monochromatic
triangle. Then m additional random edges are added to the graph one by
one, which must be coloured instantly. The second round is called the
online phase of the game. How long can it last without creating a
monochromatic triangle?
Friedgut, Kohayakawa, Rödl, Rucinski, and Tetali (2003) proved bounds
for 2- and 3-colourings if G has density cn{-1/2} for arbitrary small
c>0. In my talk, I will present a new short proof for this result and
extensions of it to graphs of lower density.
(Joint work with Y. Kohayakawa, V. Rödl and A. Steger)
Upcoming talks | All previous talks | Talks by speaker |  Upcoming talks in iCal format (beta version!) Previous talks by year: 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.3392 | admin login
|
