BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Torsten Ueckerdt (Karlsruher Institut für Technologie)
DTSTART:20230420T141500Z
DTEND:20230420T160000Z
DTSTAMP:20260422T070057Z
UID:CJCS/110
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/110/">W
 hen Surrounding is not Catching in Cops and Robber</a>\nby Torsten Ueckerd
 t (Karlsruher Institut für Technologie) as part of Copenhagen-Jerusalem C
 ombinatorics Seminar\n\n\nAbstract\nAfter a short introduction of the clas
 sical game of Cops and Robber on graphs\, we shall discuss two recently in
 troduced variants in which the robber only loses when he is completely sur
 rounded by the cops. In the first variant the robber is surrounded when he
  sits at a vertex v and there is at least one cop on each neighbor of v. I
 n the second variant cops occupy edges of the graph and the robber (still 
 moving on vertices) is surrounded if he sits at a vertex v and there is at
  least one cop on each incident edge at v. We shall compare these games wi
 th each other and also with the classical game in which the robber is alre
 ady caught when one cop sits on the same vertex as the robber.\n
LOCATION:https://researchseminars.org/talk/CJCS/110/
END:VEVENT
END:VCALENDAR