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, May 06, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Andreas Noever

Online Ramsey Games in Random Graphs

Consider the following one player game: We start with an empty graph on n vertices. Each round an edge is selected u.a.r. and added to the graph. The player has to color it immediately ('online') with one of the r available colors. For how long can she avoid a monochromatic copy of a fixed graph F? For the two color case thresholds are known for a large number of graphs. For more than two colors no tight bounds were known. We prove a tight upper bound for an arbitrary number of colors for a class of graphs which includes cycles and cliques.


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