Georgia Institute of Technology College of Sciences

In a highly influential paper from 1978, Lovász used topological methods to determine the chromatic number of the Kneser graph of the set of k-element subsets of a set with n elements. In this talk, we will discuss the Kneser graph of the set of triangulations of a convex n-gon and a recent proof that the chromatic number of this graph is n-2. The geometry of the associahedron will play a particularly important role in the argument. Based on a joint work with Anton Molnar, Cosmin Pohoata and Daniel Zhu.