Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\)

DOI10.1016/J.DISC.2021.112430zbMath1466.05113OpenAlexW3157121578WikidataQ114190618 ScholiaQ114190618MaRDI QIDQ2032752

Johann Bellmann, Bjarne Schülke

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112430

zbMATH Keywords

Hamiltonian cycleKneser graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Triangle-free Hamiltonian Kneser graphs
• Hamiltonian Kneser graphs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Distance-2 Cyclic Chaining of Constant-Weight Codes

This page was built for publication: Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\)