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, November 15, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Ralph Keusch

Lower and Upper Bounds for the general Colorability Saturation Game

We study the following two-player-game: Mini and Maxi start with the empty graph on n vertices and take turns in which they add an edge such that the graph remains k-colorable. The process stops when the graph is saturated, i.e., a complete k-partition. Mini wants that this happens as soon as possible, while Maxi aims to play for as long as possible. The score s(n,k) denotes the number of edges of the final graph, given that both players follow an optimal strategy. In this talk, we improve a previous result of Hefetz, Krivelevich, Naor, and Stojakovic, and provide almost-matching lower and upper bounds on s(n,k).

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