Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, October 15, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Miloš Stojaković (University of Novi Sad)

Maker-Breaker games on random geometric graphs

In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. A random geometric graph G(n,r) is obtained by choosing n points uniformly at random in the unit square; two points x and y are adjacent if their distance d(x,y) is at most r. The hitting radius for an increasing graph property P is inf{r>=0: G(n,r) satisfies P}. For each of four standard positional games, the connectivity game, the Hamilton cycle game, the perfect matching game and the H-game (for a fixed graph H), we show that the hitting radius of Maker's win on a random geometric graph is w.h.p. the same as the hitting radius of a simple graph-theoretic condition. This is joint work with Andrew Beveridge, Andrzej Dudek, Alan Frieze and Tobias Müller.


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

Previous talks by year:   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