A short proof of the middle levels theorem
From MaRDI portal
Publication:4645033
DOI10.19086/da.3659zbMath1404.05107arXiv1710.08249OpenAlexW2963999055WikidataQ129770612 ScholiaQ129770612MaRDI QIDQ4645033
Petr Gregor, Jerri Nummenpalo, Torsten Mütze
Publication date: 9 January 2019
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.08249
Related Items (15)
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 ⋮ Unnamed Item ⋮ On the central levels problem ⋮ Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice ⋮ A numeral system for the middle-levels graphs ⋮ Rainbow Cycles in Flip Graphs ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes and symmetric chains ⋮ On orthogonal symmetric chain decompositions ⋮ Rainbow Cycles in Flip Graphs. ⋮ Sparse Kneser graphs are Hamiltonian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long cycles in the middle two layers of the discrete cube
- Gray codes with restricted density
- Explicit matchings in the middle levels of the Boolean lattice
- An explicit 1-factorization in the middle of the Boolean lattice
- Trimming and gluing Gray codes
- Monotone Gray codes and the middle levels problem
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- Proof of the middle levels conjecture
- Probabilistic combinatorics and the recent work of Peter Keevash
- A constant-time algorithm for middle levels Gray codes
- Catalan Numbers
- Magical Mathematics
- Bipartite Kneser graphs are Hamiltonian
- A minimum-change version of the Chung-Feller theorem for Dyck paths
This page was built for publication: A short proof of the middle levels theorem
