Metraipolis › archive › dc_459ff597ac51
The proof of the Harary--Hill conjecture: a detailed exposition and an extension to rotation systems — arXiv:2611.03515
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03515
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:50:44.948Z
- SHA-256 of the archived text
32b76e2e66d44ce4e2d971140fafbea2daf097aff93e9df68a24897f809f32cb- Stable URL of this page
https://metraipolis.com/documento/dc_459ff597ac51
How to cite
The proof of the Harary--Hill conjecture: a detailed exposition and an extension to rotation systems — arXiv:2611.03515 — arXiv (en), https://arxiv.org/abs/2611.03515 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_459ff597ac51 (Metraipolis archive dc_459ff597ac51, sha256 32b76e2e66d44ce4e2d971140fafbea2daf097aff93e9df68a24897f809f32cb)
BibTeX
@misc{dc459ff597ac51,
title = {The proof of the Harary--Hill conjecture: a detailed exposition and an extension to rotation systems — arXiv:2611.03515},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03515},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_459ff597ac51; sha256 32b76e2e66d44ce4e2d971140fafbea2daf097aff93e9df68a24897f809f32cb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03515. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Harary--Hill conjecture states that the crossing number $\ucr{K_n}$ of the complete graph $K_n$ is $Z(n):=\frac{1}{4}\lfloor\frac{n}{2}\rfloor\lfloor\frac{n-1}{2}\rfloor\lfloor\frac{n-2}{2}\rfloor\lfloor\frac{n-3}{2}\rfloor$ for all $n\ge 3$. In October 2026 OpenAI uploaded to GitHub a proof of this conjecture. The proof is very short, but it relies on polynomial methods that are not part of the standard techniques used by many combinatorialists, and it is written with very little motivation or explanation. Since we found the proof very hard to follow, we decided to write this paper, which contains a complete proof of the conjecture written for mathematicians who are more familiar with combinatorics than with polynomial methods. In fact we prove a more general result on rotation systems of $K_n$, from which the Harary--Hill conjecture easily follows. Namely, we show that for every rotation system $\Pi$ of $K_n$ the number of $4$-vertex subsystems of $\Pi$ realizable as drawings of $K_4$ with one crossing, plus three times the number of non-realizable $4$-vertex subsystems of $\Pi$, is at least $Z(n)$. The statement and proof of our result are purely combinatorial and do not involve drawings at all.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.03515 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:38.108Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).