18 December 2019
About the lecture
The list chromatic number of a graph G is the minimum k so that for every assignment of a list of k colors to any vertex of G there is a vertex coloring assigning to each vertex a color from its list, so that adjacent vertices get distinct colors. This notion was introduced by Vizing and by Erdős, Rubin and Taylor in the late 70s and its study combines combinatorial, probabilistic and algebraic techniques. Its natural extension to hypergraphs is closely related to questions in Euclidean Ramsey Theory.
Professor Alon will discuss several old and new problems and results in the area focusing on a recent work with Briceno, Chandgotia, Magazinov and Spinka motivated by questions in statistical physics regarding vertex colorings of the d-dimensional lattice.
Princeton University, USA and Tel Aviv University, Israel