An inductive construction for Hamilton cycles in Kneser graphs

MaRDI QIDQ640449zbMATH OpenFDO

Authors J. Robert Johnson

Publication date 18 October 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p189.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Triangle-free Hamiltonian Kneser graphs
• Hamiltonian Kneser graphs
• Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\)
• Sparse Kneser graphs are Hamiltonian

Cited in

(13)

• Bipartite Kneser graphs are Hamiltonian
• Proof of the middle levels conjecture
• Hamiltonian Kneser graphs
• Triangle-free Hamiltonian Kneser graphs
• Kneser graphs are Hamiltonian
• Gray codes and symmetric chains
• Gray codes and symmetric chains
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Long induced paths and cycles in Kneser graphs
• Hamiltonian cycles in Kneser graphs for \(n=2k+2\)
• Sparse Kneser graphs are Hamiltonian
• Bipartite Kneser graphs are Hamiltonian
• A note on the middle levels problem

This page was built for publication: An inductive construction for Hamilton cycles in Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640449)