What is recorded here?
A constructive proof joins a cycle factor through explicitly described six-cycles to obtain a Hamilton cycle in the middle levels of an odd-dimensional cube.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
This is the 2018 short proof, following the earlier proof credited by its authors. WRS retains the complete version-2 narrative and checks finite instances through n=6. Finite checks do not prove the theorem for all n or the asymptotic lower bound on the number of cycles. The earlier PDF-ingestion experiment remains a separate historical object.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Petr Gregor; Torsten Mütze; Jerri Nummenpalo
Listed source contributors; individual labor shares are not measured
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: Czech Republic, Germany, Switzerland
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
A short constructive proof of the middle levels theorem
A constructive proof joins a cycle factor through explicitly described six-cycles to obtain a Hamilton cycle in the middle levels of an odd-dimensional cube.
Scientific scope
This is the 2018 short proof, following the earlier proof credited by its authors. WRS retains the complete version-2 narrative and checks finite instances through n=6. Finite checks do not prove the theorem for all n or the asymptotic lower bound on the number of cycles. The earlier PDF-ingestion experiment remains a separate historical object.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Petr Gregor; Torsten Mütze; Jerri Nummenpalo
Listed source contributors; individual labor shares are not measured