The antipodal layers problem

DOI10.1016/0012-365X(94)90115-5zbMath0817.05042OpenAlexW1996407906MaRDI QIDQ1322186

Glenn H. Hurlbert

Publication date: 23 July 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90115-5

zbMATH Keywords

bipartite graphHamiltonianBoolean latticeranked posetsantipodal layers problemmiddle layers problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (12)

The dimension of interior levels of the Boolean lattice ⋮ On the central levels problem ⋮ Triangle-free Hamiltonian Kneser graphs ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Cyclic sequences of \(k\)-subsets with distinct consecutive unions ⋮ On generalized middle-level problem ⋮ Monotone Gray codes and the middle levels problem ⋮ A constant-time algorithm for middle levels Gray codes ⋮ An update on the middle levels problem ⋮ Kneser graphs are Hamiltonian for \(n\geq 3k\) ⋮ Gray codes from antimatroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lexicographic matchings cannot form Hamiltonian cycles
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Explicit matchings in the middle levels of the Boolean lattice
• More odd graph theory
• Hamilton cycles in regular 2-connected graphs
• Lexicographic matching in Boolean algebras
• Long cycles in vertex-transitive graphs
• Updating the hamiltonian problem—A survey

This page was built for publication: The antipodal layers problem