Sparse Kneser graphs are Hamiltonian

DOI10.1145/3188745.3188834zbMath1428.05179arXiv1711.01636OpenAlexW2767495301MaRDI QIDQ5230348

Bartosz Walczak, Torsten Mütze, Jerri Nummenpalo

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01636

zbMATH Keywords

vertex-transitive graphHamilton cycleKneser graphodd graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

On a Combinatorial Generation Problem of Knuth ⋮ On semi-transitive orientability of Kneser graphs and their complements ⋮ The toughness of Kneser graphs ⋮ A numeral system for the middle-levels graphs ⋮ Spectrum of Johnson graphs

This page was built for publication: Sparse Kneser graphs are Hamiltonian