Speaker: Zimu Xiang (UIUC)
Title: Equitable list coloring of planar graphs with given maximum degree
Abstract: Motivated by Brooks' Theorem and Hajnal-Szemerédi Theorem, Chen-Lih-Wu conjecture states that every r-colorable graph G with maximum degree at most r should admit an equitable r-colorable unless r is odd and G contains K_{r,r}. In this talk, we confirm a list analog of the Chen-Lih-Wu conjecture for planar graph with maximum degree at least nine. Together with previous results, we also confirm a list analog of Hajnal-Szemerédi Theorem for planar graphs.
This is joint work with Hal Kierstead and Alexandr Kostochka.
