On the central levels problem
From MaRDI portal
Publication:2692785
DOI10.1016/j.jctb.2022.12.008OpenAlexW4317607151MaRDI QIDQ2692785
Petr Gregor, Ondřej Mička, Torsten Mütze
Publication date: 23 March 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.01566
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics of partially ordered sets (06A07) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian cycles and symmetric chains in Boolean lattices.
- On generalized middle-level problem
- Gray codes with restricted density
- Explicit matchings in the middle levels of the Boolean lattice
- Strong versions of Sperner's theorem
- Recursive matching algorithms and linear orders on the subset lattice
- The antipodal layers problem
- On the degree of Boolean functions as real polynomials
- Triangle-free Hamiltonian Kneser graphs
- Venn diagrams and symmetric chain decompositions in the Boolean lattice
- On edge decompositions of posets
- Trimming and gluing Gray codes
- Half-simple symmetric Venn diagrams
- Monotone Gray codes and the middle levels problem
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Gray codes and symmetric chains
- Lexicographic matching in Boolean algebras
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- On a conjecture of Füredi.
- Perfect matchings extend to Hamilton cycles in hypercubes
- Matchings extend into 2-factors in hypercubes
- On hypercube labellings and antipodal monochromatic paths
- On a lemma of Littlewood and Offord on the distribution of certain sums
- Proof of the middle levels conjecture
- Probabilities of Independent Choices Being Ordered
- An improved upper bound on the crossing number of the hypercube
- Efficient generation of the binary reflected gray code and its applications
- A Survey of Combinatorial Gray Codes
- A constant-time algorithm for middle levels Gray codes
- A short proof of the middle levels theorem
- On the distribution of sums of residues
- Catalan Numbers
- Orthogonal Symmetric Chain Decompositions of Hypercubes
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Crossing Number Problems
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Bipartite Kneser graphs are Hamiltonian
This page was built for publication: On the central levels problem
