Triangle-free Hamiltonian Kneser graphs

DOI10.1016/S0095-8956(03)00040-6zbMath1030.05069OpenAlexW2081921708MaRDI QIDQ1410728

Ya-Chen Chen

Publication date: 15 October 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00040-6

zbMATH Keywords

Hamiltonian cyclesKruskal-Katona theoremKneser graphsantipodal layers problemBaranyai theoremuniform subset graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Extremal set theory (05D05) Eulerian and Hamiltonian graphs (05C45)

Related Items (17)

A note on the middle levels problem ⋮ Large cycles in generalized Johnson graphs ⋮ On the central levels problem ⋮ Arrangements of \(k\)-sets with intersection constraints ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Cyclic sequences of \(k\)-subsets with distinct consecutive unions ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) ⋮ Diameters of uniform subset graphs ⋮ The toughness of Kneser graphs ⋮ Proof of the middle levels conjecture ⋮ A constant-time algorithm for middle levels Gray codes ⋮ On hamiltonian cycles in the prism over the odd graphs ⋮ Hamiltonian Cycles in Kneser Graphs for ⋮ Sparse Kneser graphs are Hamiltonian ⋮ On the bandwidth of the Kneser graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian uniform subset graphs
• On t-designs
• The antipodal layers problem
• Monotone Gray codes and the middle levels problem
• The Rugby footballers of Croam
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Binomial and \(q\)-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their \(q\)-analogues
• The footballers of Croam

This page was built for publication: Triangle-free Hamiltonian Kneser graphs