Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 11, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Tibor Szabó
We consider two-player positional games played on the edges of the complete graph. Players Avoider and Enforcer take turns in occupying yet unoccupied edges of $K_n$. In each round Avoider occupies one edge and Enforcer occupies $b$ edges. Avoider wins the game of connectivity if at the end of the game his edges do NOT occupy a spanning tree, otherwise Enforcer wins. Other frequently studied games involve the graph theoretic properties of having minimum degree at least $k$, containing a perfect matching, or a Hamilton cycle. In general, we are searching for the smallest bias $b$ against which Avoider is able to win these games against a skillful Enforcer. In the talk I will elaborate on a couple of surprising phenomena related to this problem.
Joint work with D. Hefetz, M. Krivelevich, and M. Stojaković.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 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.4803M | admin login