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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 27, 2019, 12:15 pm

Duration: 30 minutes

Location: CAB G 11

Speaker: Maxime Larcher

Win Conditions in Maker-Breaker Games on Uniform Hypergraphs

We study win conditions in Maker-Breaker games on uniform hypergraphs.

In a first step, we find an approximation of the minimal number of boxes required for the Maker to win on uniform box games. We then study a variation of the box game and show that, if few boxes are missing, adding few new edges on the remaining vertices suffices to have the Maker win.

In a second step, we find a win condition for the Maker based on the maximal degree of the hypergraph, still assuming uniformity.

Finally, we take a look at games on random hypergraphs and find threshold probabilities above which the Maker is able to win w.h.p.

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

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