A Lov\'asz-Kneser theorem for triangulations
Abstract
We show that the Kneser graph of triangulations of a convex n-gon has chromatic number n-2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.