BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1453
DTSTAMP:20240719T064159Z
SUMMARY:Catch them if you can
DESCRIPTION:Speaker: Juhi Chaudhary (TIFR)\n\nAbstract: \nThe Cops and Robb
 er game is a well-studied two-player pursuit-evasion game played on graphs
 \, where a team of cops attempts to capture a robber. The cop number of a 
 graph represents the minimum number of cops required for a successful capt
 ure. Graphs with a cop number of one are known as cop-win graphs. In this 
 seminar\, I will begin by characterizing cop-win graphs. Subsequently\, I 
 will demonstrate\, using the technique of guarding a subgraph—a method f
 or bounding the cop number of graphs with geometric representations—that
  the cop number for planar graphs is atmost three.\n
URL:https://www.tcs.tifr.res.in/web/events/1453
DTSTART;TZID=Asia/Kolkata:20240720T143000
DTEND;TZID=Asia/Kolkata:20240720T153000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR