A book proof of the middle levels theorem
Abstract
We give a short constructive proof for the existence of a Hamilton cycle in the subgraph of the (2n+1)-dimensional hypercube induced by all vertices with exactly n or n+1 many 1s.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.