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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, July 30, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Ralph Keusch

In this thesis we study the game in which two players take turns coloring the vertices of a given graph G with k colors. In each move the current player colors a vertex such that neighboring vertices get different colors. The first player wins if and only if at the end, all the vertices are colored. Then the *game chromatic number* χ_{g}(G) is defined as the smallest k for which the first player has a winning strategy.

We analyse this parameter for random graphs G_{n,p}, where p is a constant. We improve the existing results on this class of graphs and prove that with high probability, the game chromatic number χ_{g}(G_{n,p}) is exactly twice as large as the ordinary chromatic number χ(G_{n,p}).

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