Kneser graphs are Hamiltonian for \(n\geq 3k\)
From MaRDI portal
Publication:1850485
DOI10.1006/jctb.2000.1969zbMath1024.05055WikidataQ29398606 ScholiaQ29398606MaRDI QIDQ1850485
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1969
Hamiltonian cycles; Gray code; uniform subset graph; antipodal layer problem; Erdős revolving door problem
Related Items
Bipartite Kneser graphs are Hamiltonian, A minimum-change version of the Chung-Feller theorem for Dyck paths, Sperner type theorems with excluded subposets, Arrangements of \(k\)-sets with intersection constraints, A new class of transitive graphs, Diameters of uniform subset graphs, Triangle-free Hamiltonian Kneser graphs, Decomposition of the Kneser graph into paths of length four, Graphs as navigational infrastructure for high dimensional data spaces
Cites Work
- Hamiltonian uniform subset graphs
- Two Hamilton cycles in bipartite reflective Kneser graphs
- The antipodal layers problem
- Monotone Gray codes and the middle levels problem
- The Rugby footballers of Croam
- Binomial and \(q\)-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their \(q\)-analogues
- A note on Hamiltonian circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item