University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > The Namer-Claimer game

The Namer-Claimer game

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

If you have a question about this talk, please contact Johannes Carmesin.

Consider the following game played by two players, Namer and Claimer, on the board [n]. In each round, Namer names a forbidden distance d, then Claimer claims a subset of [n] not containing two points at distance d. The game ends once Claimer has claimed all of [n]; Claimer wants this to happen as fast as possible, and Namer wants to delay it. How long is the game with optimal play from each side? The answer reveals a surprising connection with arithmetic Ramsey theory.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.