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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 29, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Henning Thomas

Balanced Online Ramsey Games in Random Graphs

We consider the following one-player game: The player, called Painter, starts with the empty graph on n vertices. In every step she is presented r edges drawn u.a.r. from all remaining ones, which she has to color instantly with r available colors using each color exactly once. Her goal is to avoid a monochromatic copy of a given fixed graph F as long as possible. Marciniszyn, Mitsche and Stojakovic proved a threshold phenomenon for the duration of this game for r=2 and a variety of graphs F, e.g. cycles. Using different techniques (the methods of first and second moment) we extend their result to an arbitrary number of colors and a larger class of graphs, e.g. cliques of size t if r \geq t. We also discuss ideas on a general threshold for arbitrary graphs.

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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