Hamiltonian Kneser graphs

DOI10.1007/S004930200007zbMath0989.05070OpenAlexW2025576689MaRDI QIDQ1603265

Ya-Chen Chen, Zoltan Fueredi

Publication date: 25 June 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200007

zbMATH Keywords

Hamilton cyclesKneser graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Hamiltonicity, minimum degree and leaf number ⋮ Sperner type theorems with excluded subposets ⋮ Arrangements of \(k\)-sets with intersection constraints ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) ⋮ Sparse Kneser graphs are Hamiltonian

This page was built for publication: Hamiltonian Kneser graphs