Infinite Maker-Breaker games

Add to your list(s) Download to your calendar using vCal

• Nathan Bowler (Hamburg)
• Thursday 16 June 2022, 14:30-15:30
• MR12.

If you have a question about this talk, please contact HoD Secretary, DPMMS.

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.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.