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 Gn,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(Gn,p) is exactly twice as large as the ordinary chromatic number χ(Gn,p).
Automatic MiSe System Software Version 1.4803M | admin login