Abstract

Some list coloring problems

Bill Cuckler
Mon Oct 11 at 1:10pm in the Graduate Student Lounge

I will talk about the following open problem of Albertson, Grossman, and Haas: Given a graph with list chromatic number t and lists of size s assigned to every vertex (s < t), at least s/t fraction of the vertices of the graph can be properly colored from the lists. I will give a proof of the best known result, due to Chappell, and talk about other list coloring problems if time permits.