Dan Guyer, University of Washington
-
PDL C-401
Kneser’s conjecture was open for 20 years before Lovász used the Borsuk-Ulam Theorem to (tightly) bound the chromatic number of all Kneser Graphs. Since then, there has been much work expanding this theory by Babson-Kozlov and others. Our goal will be to get a taste of the general ``test map” strategy and illustrate a few combinatorial results that quickly fall to the power of these techniques. Such results will consist of bounds for the chromatic number of (hyper)graphs and embeddability results for simplicial complexes.
Zoom Link: https://washington.zoom.us/j/92849568892