Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, May 12, 2016, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Christian Wieser
Consider the following one-player game played on an initially empty graph on n vertices. In every round one randomly chosen edge will be inserted and the player has to color this edge with one of the r available colors. How long does it take, before he is forced to create a monochromatic copy of F? For some graphs the threshold is already known. One graph not being in that class is the bow-tie graph where two triangles are connected at one point. In the talk the threshold for that graph and two colors will be presented.
Automatic MiSe System Software Version 1.4803M | admin login