MATH Seminar

Title: List colorings of infinite graphs
Seminar: Combinatorics
Speaker: Peter Komjath of Eotvos Lorand University and Emory University
Contact: Dwight Duffus, dwight@mathcs.emory.edu
Date: 2011-10-28 at 4:00PM
Venue: W306
Download Flyer
Abstract: After a short reminder of things like alephs and well ordering, we consider the notions of coloring number and list-chromatic number for infinite graphs and compare them with the chromatic number and each other, and calculate the list chromatic number for some complete bipartite graphs. We state some theorems essentially saying that, for uncountable graphs, the list chromatic number can be equal to the coloring number, to the chromatic number, but not both.