Return to Colloquia & Seminar listing
An Introduction to the Choice Number
Student-Run Discrete Mathematics| Speaker: | Matt Stamps, UC Davis |
| Location: | 2112 MSB |
| Start time: | Thu, Feb 14 2008, 3:10PM |
Description
The choice number (or list chromatic number) of a graph is a natural
generalization of the chromatic number. We will build up all of the tools
and definitions necessary to understand this parameter and use it prove a
nice result by Thomassen that every planar graph is 5-choosable. No prior
knowledge of graph theory is needed to understand this talk.