BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/315
DTSTAMP:20230914T125919Z
SUMMARY:Five-Coloring Plane Graphs
DESCRIPTION:Speaker: Shishir Pandey\n\nAbstract: \nThe four-color theorem s
tates that it is always possible to color the regions of a plane map with
four colors such that regions that share a boundary receive different colo
rs. This theorem was proven in 1976 by Appel and Haken. The proof of the t
heorem required the calculating power of computers. Although I have a good
computer (probably more powerful than the computer that was used in the o
riginal proof)\, we will not try to prove the four-color theorem. We will
be modest and prove that we can color a plane map with five colors.\n
URL:https://www.tcs.tifr.res.in/web/events/315
DTSTART;TZID=Asia/Kolkata:20121019T150000
DTEND;TZID=Asia/Kolkata:20121019T163000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR