Tuesday, Nov 16, 3pm ET (8pm GMT, 9am Wed NZDT)
Nathan Bowler, University of Hamburg
Infinite Maker-Breaker games
Consider a game played on a countably infinite complete graph, in which two players, called Maker and Breaker, alternately claim edges. Maker’s aim is that after infinitely many moves she should have claimed all edges of some infinite complete subgraph, and Breaker’s aim is to prevent this. Marit Emde recently found a winning strategy for Maker in this game. We’ll investigate a number of variants of this basic game, and the kinds of winning strategies Maker and Breaker have in them.