Hamiltonian Kneser graphs
From MaRDI portal
Publication:1603265
DOI10.1007/s004930200007zbMath0989.05070MaRDI QIDQ1603265
Publication date: 25 June 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930200007
Related Items
Sparse Kneser graphs are Hamiltonian, Bipartite Kneser graphs are Hamiltonian, 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, Hamiltonicity, minimum degree and leaf number, Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\)