English

Kneser Graphs of Triangulations are Hamiltonian

Combinatorics 2026-04-24 v1

Abstract

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

Keywords

Cite

@article{arxiv.2604.21888,
  title  = {Kneser Graphs of Triangulations are Hamiltonian},
  author = {Anton Molnar and Cosmin Pohoata and Michael Zheng},
  journal= {arXiv preprint arXiv:2604.21888},
  year   = {2026}
}

Comments

13 pages, 2 figures, comments welcome!