On the central levels problem

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

The central levels problem asserts that the subgraph of the $(2m+1)$-dimensional hypercube induced by all bitstrings with at least $m+1-\ell$ many 1s and at most $m+\ell$ many 1s,…