Coloring Problems
The Four Color Conjecture, which asked if the faces of a plane map could be colored with 4 or fewer colors, inspired great progress in geometrical graph theory.
Event details
When
Oct 24, 2007
from 03:00 PM to 04:00 PM
from 03:00 PM to 04:00 PM
Where
Academic Core: 2C 07 (Math/CS Department Conference Room)
Contact Name
Contact Phone
718-262-2551
This talk will survey some of the basics of vertex and face coloring problems, as well as a variety of applications for such problems. One example of such an application is the scheduling of final examinations at colleges. The talk will also provide a brief outline of the history of the solution of the Four Color Conjecture.
Speaker:
Joseph Malkevitch
