Kneser Graphs of Triangulations are Hamiltonian

TL;DR

This paper proves that for any convex polygon with at least five sides, the Kneser graph formed from its triangulations always contains a Hamiltonian cycle, revealing a new structural property.

Contribution

The paper establishes the existence of Hamiltonian cycles in Kneser graphs of triangulations for all convex polygons with at least five sides, a novel result in combinatorial graph theory.

Findings

Kneser graph of triangulations of convex n-gon contains a Hamiltonian cycle for all n ≥ 5

The result applies to all convex polygons with at least five sides

Provides new insights into the structure of triangulation graphs

Abstract

For every $n \geq 5$, we show that the Kneser graph of triangulations of a convex $n$-gon contains a Hamiltonian cycle.