The antipodal layers problem

DOI10.1016/0012-365X(94)90115-5MaRDI QIDQ1322186zbMATH OpenOpenAlexFDO

Authors 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 graphHamiltonianranked posetsBoolean latticeantipodal layers problemmiddle layers problem

Mathematics Subject Classification ID

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

Recommendations

• An update on the middle levels problem
• Proof of the middle levels conjecture
• On generalized middle-level problem
• scientific article; zbMATH DE number 3916312
• scientific article; zbMATH DE number 1439443

Cites work

• scientific article; zbMATH DE number 3838053 (Why is no real title available?)
• scientific article; zbMATH DE number 3916312 (Why is no real title available?)
• scientific article; zbMATH DE number 3630799 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3383912 (Why is no real title available?)
• Explicit matchings in the middle levels of the Boolean lattice
• Graph theory with applications
• Hamilton cycles in regular 2-connected graphs
• Lexicographic matching in Boolean algebras
• Lexicographic matchings cannot form Hamiltonian cycles
• Long cycles in vertex-transitive graphs
• More odd graph theory
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Updating the hamiltonian problem—A survey

Cited in

(15)

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

This page was built for publication: The antipodal layers problem

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