BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Covering Pursuit Game - Ben Gillott (Cambridge)
DTSTART:20250320T143000Z
DTEND:20250320T153000Z
UID:TALK229543@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:In the `Covering' game on a graph\, a robber and a set of cops
  play alternately\, with the cops\neach moving to a vertex at distance at 
 most 1 from their current vertex and the robber moving to a vertex\nat dis
 tance at most 2 from his current vertex. The cops win if\, after every one
  of their moves\, there is\nalways a cop at the same vertex as the robber.
  How few cops are needed? We investigate this problem\nfor the two-dimensi
 onal grid. There are applications to the game of `Catching a Fast Robber'\
 , and our\nwork answers questions of Bollobas and Leader and of Balister\,
  Bollobas\, Narayanan and Shaw.
LOCATION:MR12
END:VEVENT
END:VCALENDAR