*********************************** * Princeton Discrete Math Seminar * *********************************** Speaker: James Davies (Waterloo) Thursday March 24, 3:00, via Zoom. The link is https://princeton.zoom.us/j/91478959279, and the password will be mailed to the seminar mailing list. Title: Separating polynomial chi-boundedness from chi-boundedness We prove that for every function f that is lower-bounded by a certain cubic polynomial, there is a hereditary class of graphs F such that for every k > 1, the maximum chromatic number of a graph in F with clique number k is equal to f(k). This extends a recent breakthrough of Carbonero, Hompe, Moore, and Spirkl. In particular, this proves that there are hereditary classes of graphs that are chi-bounded but not polynomially chi-bounded. Joint work with Marcin BriaƄski and Bartosz Walczak. ---------------------------------- Anyone wishing to be added to or removed from the mailing list should contact Paul Seymour (pds@math.princeton.edu)