An explicit 1-factorization in the middle of the Boolean lattice

DOI10.1016/0097-3165(94)90030-2zbMath0795.05111OpenAlexW1982120981MaRDI QIDQ1320401

D. A. Duffus, Hunter S. Snevily, Henry A. Kierstead

Publication date: 7 September 1994

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

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90030-2

zbMATH Keywords

Boolean latticematchings1-factorization

Mathematics Subject Classification ID

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

Related Items (19)

A note on the middle levels problem ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ Graphs that admit square 1-factorizations are hamiltonian Cayley graphs ⋮ On a Combinatorial Generation Problem of Knuth ⋮ 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 ⋮ A short proof of the middle levels theorem ⋮ Explicit 2-factorizations of the odd graph ⋮ The prism over the middle-levels graph is Hamiltonian ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice ⋮ Proof of the middle levels conjecture ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ 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

Cites Work

• Explicit matchings in the middle levels of the Boolean lattice
• A sharp bound for the number of sets that pairwise intersect at \(k\) positive values

This page was built for publication: An explicit 1-factorization in the middle of the Boolean lattice