Sparse Kneser graphs are Hamiltonian
From MaRDI portal
Publication:5230348
DOI10.1145/3188745.3188834zbMath1428.05179arXiv1711.01636MaRDI QIDQ5230348
Torsten Mütze, Bartosz Walczak, 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
05C45: Eulerian and Hamiltonian graphs