Kneser Graphs of Triangulations are Hamiltonian
Abstract
For every n ≥ 5, we show that the Kneser graph of triangulations of a convex n-gon contains a Hamiltonian cycle.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.