Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Tuesday, November 05, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Rajko Nenadov

On the threshold for the Maker-Breaker H-game

We study the Maker-Breaker H-game played on the edge set of the random graph G(n, p). In this game, two players, Maker and Breaker, alternately claim unclaimed edges of G(n, p), until all the edges are claimed. Maker wins if he claims all the edges of a graph H; Breaker wins otherwise. Recently, Müller and Stojaković determined the threshold for the graph property that Maker can win this game if H is a k-clique. Extending their result, we determine the threshold for a large class of graphs, namely those which contain a cycle and whose 2-density is not determined by a K_3 subgraph.

Joint work with Miloš Stojaković and Angelika Steger.

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

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