# On the central levels problem

@article{Gregor2020OnTC,
title={On the central levels problem},
author={Petr Gregor and Ondrej Micka and Torsten M{\"u}tze},
journal={ArXiv},
year={2020},
volume={abs/1912.01566}
}
• Published 3 December 2019
• Computer Science
• ArXiv
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, i.e., the vertices in the middle $2\ell$ levels, has a Hamilton cycle for any $m\geq 1$ and $1\le \ell\le m+1$. This problem was raised independently by Savage, by Gregor and Skrekovski, and by Shen and Williams, and it is a common generalization of the well-known middle levels problem, namely the case $\ell=1$, and…
3 Citations

## Figures and Tables from this paper

### Gray codes and symmetric chains

• Computer Science, Mathematics
ICALP
• 2018

### On a combinatorial generation problem of Knuth

• Mathematics, Computer Science
SODA
• 2021
This work proves Knuth's conjecture in a more general form, allowing for arbitrary shifts $s\geq 1$ that are coprime to $2n+1$, and presents an algorithm to compute this ordering, generating each new bitstring in $\mathcal{O}(n)$ time.

### Combinatorial Gray codes-an updated survey

This survey provides a comprehensive picture of the state-of-the-art of the research on combinatorial Gray codes and gives an update on Savage’s influential survey, incorporating many more recent developments.

## References

SHOWING 1-10 OF 70 REFERENCES

### Gray codes and symmetric chains

• Computer Science, Mathematics
ICALP
• 2018

### A Constant-Time Algorithm for Middle Levels Gray Codes

• Computer Science
Algorithmica
• 2019

### Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture

It is proved that the sensitivity and degree of a boolean function are polynomially related, solving an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.