Mittagsseminar Talk Information

Date and Time: Tuesday, February 05, 2008, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Miloš Stojaković (Univ. u Novom Sadu)

Slow losing again

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ó.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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.3392   |   admin login