BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:The Namer-Claimer game - Ben Barber\, University o
f Bristol
DTSTART:20181129T150000Z
DTEND:20181129T160000Z
UID:TALK3345AT
URL:/talk/index/3345
DESCRIPTION:Consider the following game played by two players\
, Namer and Claimer\, on the board [n]. In each r
ound\, Namer names a forbidden distance d\, then C
laimer claims a subset of [n] not containing two p
oints at distance d. The game ends once Claimer h
as claimed all of [n]\; Claimer wants this to happ
en as fast as possible\, and Namer wants to delay
it. How long is the game with optimal play from e
ach side? The answer reveals a surprising connect
ion with arithmetic Ramsey theory.
LOCATION:Watson LTB
CONTACT:Johannes Carmesin
END:VEVENT
END:VCALENDAR