English

A book proof of the middle levels theorem

Combinatorics 2024-07-26 v4

Abstract

We give a short constructive proof for the existence of a Hamilton cycle in the subgraph of the (2n+1)(2n+1)-dimensional hypercube induced by all vertices with exactly nn or n+1n+1 many 1s.

Keywords

Cite

@article{arxiv.2306.13019,
  title  = {A book proof of the middle levels theorem},
  author = {Torsten Mütze},
  journal= {arXiv preprint arXiv:2306.13019},
  year   = {2024}
}

Comments

Fixed a small error in Figure 1