On the central levels problem

DOI10.4230/LIPICS.ICALP.2020.60MaRDI QIDQ6842513zbMATH OpenFDO

Authors Petr Gregor, Ondřej Mička, Torsten Mütze

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.60

zbMATH Keywords

gray codeHamilton cyclehypercubemiddle levelssymmetric chain decomposition

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A constant-time algorithm for middle levels Gray codes
• A short proof of the middle levels theorem
• A Survey of Combinatorial Gray Codes
• An improved upper bound on the crossing number of the hypercube
• Crossing Number Problems
• Efficient generation of the binary reflected gray code and its applications
• Explicit matchings in the middle levels of the Boolean lattice
• Gray codes and symmetric chains
• Gray codes with restricted density
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamiltonian cycles and symmetric chains in Boolean lattices.
• scientific article; zbMATH DE number 3838053 (Why is no real title available?)
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 1743965 (Why is no real title available?)
• scientific article; zbMATH DE number 866658 (Why is no real title available?)
• scientific article; zbMATH DE number 3065933 (Why is no real title available?)
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Lexicographic matching in Boolean algebras
• Matchings extend into 2-factors in hypercubes
• Monotone Gray codes and the middle levels problem
• On a conjecture of Füredi.
• On edge decompositions of posets
• On generalized middle-level problem
• On hypercube labellings and antipodal monochromatic paths
• On the degree of Boolean functions as real polynomials
• Orthogonal Symmetric Chain Decompositions of Hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Probabilities of Independent Choices Being Ordered
• Proof of the middle levels conjecture
• Recursive matching algorithms and linear orders on the subset lattice
• Strong versions of Sperner's theorem
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The search for simple symmetric Venn diagrams
• Trimming and gluing Gray codes
• Venn diagrams and symmetric chain decompositions in the Boolean lattice

This page was built for publication: On the central levels problem

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