Construction of 2-factors in the middle layer of the discrete cube

DOI10.1016/j.jcta.2012.06.005zbMath1246.05133arXiv1111.2413OpenAlexW2043423968MaRDI QIDQ444915

Torsten Mütze, Franziska Weber

Publication date: 24 August 2012

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

Full work available at URL: https://arxiv.org/abs/1111.2413

zbMATH Keywords

2-factordiscrete cubemiddle layer graphmiddle levels conjecture

Mathematics Subject Classification ID

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

Related Items (6)

Efficient Computation of Middle Levels Gray Codes ⋮ Trimming and gluing Gray codes ⋮ Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\) ⋮ 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

Cites Work

• Long cycles in the middle two layers of the discrete cube
• An update on the middle levels problem
• Gray codes with restricted density
• Lexicographic matchings cannot form Hamiltonian cycles
• Explicit matchings in the middle levels of the Boolean lattice
• Strong versions of Sperner's theorem
• An explicit 1-factorization in the middle of the Boolean lattice
• Lexicographic matching in Boolean algebras
• Unnamed Item

This page was built for publication: Construction of 2-factors in the middle layer of the discrete cube