A Lovász-Kneser theorem for triangulations

Abstract:

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. Joint work with Anton Molnar, Michael Zheng and Daniel Zhu.

Note: This talk begins with a pre-seminar (aimed at graduate students) at 3:30–4:00. The main talk starts at 4:10.

Join Zoom Meeting: https://washington.zoom.us/j/91547335974
Meeting ID: 915 4733 5974