University of Cambridge > Talks.cam > Combinatorics Seminar > Infinite Maker-Breaker games

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Infinite Maker-Breaker games

Download to your calendar using vCal

  • UserNathan Bowler (Hamburg)
  • ClockThursday 16 June 2022, 14:30-15:30
  • HouseMR12.

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:

Note that ex-directory lists are not shown.

Other lists

Department of Computer Science (Room TBA) Addenbrooke’s F&G 5 please see http://www.trophoblast.cam.ac.uk/info/seminar.shtml for directions Webinar & LT2, Computer Laboratory, William Gates Building.

Other talks

Title to be confirmed: ANUBIS Title to be confirmed Kirk Public Lecture | A proxy window into the beautiful and challenging world of causal attribution Decoding genomic chaos - a pancancer compendium of chromosomal instability Seminars in Cancer Strange New Worlds
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity