Return to Colloquia & Seminar listing
Choosability and Choice Number
Student-Run Discrete Mathematics| Speaker: | Matthew Stamps, UC Davis |
| Location: | 1147 MSB |
| Start time: | Fri, Feb 18 2011, 11:00AM |
Description
The choice number (or list chromatic number) of a graph is a natural
generalization of the chromatic number. We will introduce the necessary
tools and definitions to understand this parameter and use it prove a nice
result by Thomassen which states that every planar graph is 5-choosable.