An inductive construction for Hamilton cycles in Kneser graphs

zbMATH Open1230.05181MaRDI QIDQ640449FDOQ640449

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

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)

Cited In (11)

• Bipartite Kneser graphs are Hamiltonian
• Hamiltonian Kneser graphs
• Title not available (Why is that?)
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• A note on the middle levels problem
• Sparse Kneser graphs are Hamiltonian
• Kneser graphs are Hamiltonian
• Proof of the middle levels conjecture
• Triangle-free Hamiltonian Kneser graphs
• Bipartite Kneser graphs are Hamiltonian
• Gray codes and symmetric chains

   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 👍 👎

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)