Long cycles in the middle two layers of the discrete cube

DOI10.1016/j.jcta.2003.11.004zbMath1051.05056DBLPjournals/jct/Johnson04OpenAlexW1972816631WikidataQ64012488 ScholiaQ64012488MaRDI QIDQ598456

J. Robert Johnson

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2003.11.004

zbMATH Keywords

Hamilton cycleKneser graphodd graphdiscrete cubemiddle two layers problem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (21)

Efficient Computation of Middle Levels Gray Codes ⋮ The first three levels of an order preserving Hamiltonian path in the subset lattice ⋮ On a Combinatorial Generation Problem of Knuth ⋮ The \(q\)-analog of the middle levels problem ⋮ Trimming and gluing Gray codes ⋮ Construction of 2-factors in the middle layer of the discrete cube ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Limits of cubes ⋮ Hamiltonian cycles and symmetric chains in Boolean lattices. ⋮ The coolest way to generate binary strings ⋮ A short proof of the middle levels theorem ⋮ On generalized middle-level problem ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ 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 ⋮ An update on the middle levels problem ⋮ Sparse Kneser graphs are Hamiltonian ⋮ On Middle Cube Graphs

Cites Work

• Monotone Gray codes and the middle levels problem
• Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Long cycles in the middle two layers of the discrete cube