BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Constructible graphs and pursuit - Mark Walters (QMUL)
DTSTART:20230223T143000Z
DTEND:20230223T153000Z
UID:TALK197815@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:The simplest Cops and Robbers game is as follows. Both the cop
  and robber\nare placed on a graph and then they alternately take turns wh
 ere they\neither move to a neighbouring vertex or remain at the same verte
 x. The cop\nwins if\, at some point\, he is at the same vertex as the robb
 er -- the\nrobber wins if he can ensure this never happens.\n\nIf the grap
 h is finite then it is easy to show that a graph is cop-win if and\nonly i
 f it is constructible\, meaning that the graph can be obtained from the\no
 ne-point graph by adding dominated vertices one at a time.\n\nBut if the g
 raph is infinite then the situation is more complicated. We will\ndiscuss 
 what happens\, including the first example of a cop-win graph that is\nnot
  constructible.\n\nJoint work with Maria Ivan and Imre Leader
LOCATION:MR12
END:VEVENT
END:VCALENDAR