Tata Institute of Fundamental Research
Five-Coloring Plane Graphs
Student Seminar
Speaker:
Shishir Pandey
Organiser:
Girish Varma
Date:
Friday, 19 Oct 2012, 15:00 to 16:30
Venue:
A-212 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
The four-color theorem states 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 colors. This theorem was proven in 1976 by Appel and Haken. The proof of the theorem required the calculating power of computers. Although I have a good computer (probably more powerful than the computer that was used in the original 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.
| Speaker: | Shishir Pandey |
| Organiser: | Girish Varma |
| Date: | Friday, 19 Oct 2012, 15:00 to 16:30 |
| Venue: | A-212 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
The four-color theorem states 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 colors. This theorem was proven in 1976 by Appel and Haken. The proof of the theorem required the calculating power of computers. Although I have a good computer (probably more powerful than the computer that was used in the original 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.