Explicit matchings in the middle levels of the Boolean lattice

DOI10.1007/BF00337621zbMath0668.05045MaRDI QIDQ1117950

Henry A. Kierstead, William T. jun. Trotter

Publication date: 1988

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

Boolean latticeHamiltonian cyclematchingsHasse diagram

Mathematics Subject Classification ID

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

Related Items (31)

Efficient Computation of Middle Levels Gray Codes ⋮ Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets ⋮ Lexicographic matchings cannot form Hamiltonian cycles ⋮ On a Combinatorial Generation Problem of Knuth ⋮ A local injective proof of log-concavity for increasing spanning forests ⋮ Star transposition Gray codes for multiset permutations ⋮ Trimming and gluing Gray codes ⋮ Unnamed Item ⋮ On the central levels problem ⋮ Construction of 2-factors in the middle layer of the discrete cube ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ A short proof of the middle levels theorem ⋮ Perfect matchings in antipodally colored lattice of subsets ⋮ Explicit 2-factorizations of the odd graph ⋮ The prism over the middle-levels graph is Hamiltonian ⋮ Minimal enumerations of subsets of a finite set and the middle level problem ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice ⋮ A numeral system for the middle-levels graphs ⋮ Proof of the middle levels conjecture ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ Monotone Gray codes and the middle levels problem ⋮ A constant-time algorithm for middle levels Gray codes ⋮ On hamiltonian cycles in the prism over the odd graphs ⋮ Gray codes and symmetric chains ⋮ Boolean layer cakes ⋮ An update on the middle levels problem ⋮ Gray codes from antimatroids ⋮ An explicit 1-factorization in the middle of the Boolean lattice ⋮ The antipodal layers problem

Cites Work

• Lexicographic matchings cannot form Hamiltonian cycles
• Two Hamilton cycles in bipartite reflective Kneser graphs
• On defect-d matchings in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Explicit matchings in the middle levels of the Boolean lattice