Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, February 13, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Miloš Stojaković (Univ. u Novom Sadu)
For an Avoider-Enforcer positional game H played on the set of edges on 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 Avoider's win, we set t(H) to be
infinity). We will study this parameter for the non-planarity game, and perhaps
some other games as well...
The talk will be some sort of continuation of the talk of Dan Hefetz (February 8th), but it will be self contained.
Joint work with Dan Hefetz, Michael Krivelevich and Tibor Szabó.
Automatic MiSe System Software Version 1.4803M | admin login