MUNI Seminar series - Noga Alon - List Coloring |
December 18, 2019 from 4:30 PM at Refectory of Augustinian Abbey at Mendel Square - Mendel Museum Noga AlonList Coloring Abstract: 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. |
Last Updated on Wednesday, 18 December 2019 12:01 |