Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, February 05, 2008, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Miloš Stojaković (Univ. u Novom Sadu)
For an Avoider-Enforcer positional game H played on the set of edges of the complete graph, let t(H) be the smallest integer such that Enforcer can win the game within t(H) moves (if the game is an Avoider's win, we set t(H) to be infinity). In this talk, we will be trying to find t(H) for a few graph games H.
Joint work with János Barát, Dan Hefetz, Michael Krivelevich and Tibor Szabó.
Automatic MiSe System Software Version 1.4803M | admin login