BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1559
DTSTAMP:20250606T045327Z
SUMMARY:Are Three Petersens Enough?
DESCRIPTION:Speaker: Varun Ramanathan (TIFR)\n\nAbstract: \nThe Petersen gr
 aph is perhaps the most well-known 3-regular graph on 10 vertices. Donald 
 Knuth states (in one of his many many books) that the Petersen graph is "a
  remarkable configuration that serves as a counterexample to many optimist
 ic predictions about what might be true for graphs in general." In this ta
 lk\, we will ignore all of that and instead consider the following problem
 : can three isomorphic copies of the Petersen graph cover the complete gra
 ph on 10 vertices? While a brute-force approach should reveal the answer\,
  we will take a spectral approach to solve this problem. The talk will be 
 based on a chapter from Jiří Matoušek's book "Thirty-three miniatures."
 \n
URL:https://www.tcs.tifr.res.in/web/events/1559
DTSTART;TZID=Asia/Kolkata:20250606T160000
DTEND;TZID=Asia/Kolkata:20250606T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR