Proof of the middle levels conjecture
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 10592
- Type
- D - Journal article
- DOI
-
10.1112/plms/pdw004
- Title of journal
- Proceedings of the London Mathematical Society
- Article number
- -
- First page
- 677
- Volume
- 112
- Issue
- 4
- ISSN
- 0024-6115
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 23
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper solves a long-standing open problem in discrete mathematics that received considerable attention in the literature (over 40 papers since 1980s). The problem appears in several popular books (Diaconis&Graham, Winkler), and is ranked as the hardest open problem in Knuth's "The Art of Computer Programming 4A". Published in a highly-ranked mathematics journal, the solution received praise from many well-known researchers, including Lovász and Gowers; also led to three national research grants (Switzerland, Germany, Czechia) and to several keynote presentations (OCW'17, Gascom'18) and invited seminar talks (over 15). The solution of this problem enabled many follow-up results (SODA'17, ICALP'18, STOC'18).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -