Linhart–Eckhoff–Welzl conjecture and generalized crossing-number conjectures
For every integer , the crossing number of the complete graph satisfies . Equivalently, every drawing of in the plane has at least this many edge crossings, and this bound is attained by a drawing of .
References
- Crossing numbers of simplicial complexes — arXiv — Alfredo Hubard, Cheikh Saliou Ndiaye, Oriol Solé-Pi
Source: arXiv
Progress summary
A 2026 paper proves several special cases and adds evidence for broader crossing-number conjectures, but the main conjectures remain open.
The Linhart–Eckhoff–Welzl conjecture concerns the maximum complexity of low-level regions in arrangements, with a related graph-drawing consequence for crossings. The broader entry also tracks higher-dimensional and generalized crossing-number conjectures; none is reported as completely resolved.
Known results
- A 2025 paper proves the Linhart–Eckhoff–Welzl conjecture when and determines the relevant linear and affine relations among level face numbers.
- The same work proves the case of the small -matrix nonnegativity conjecture, namely in the stated range, and derives a lower bound for crossings in spherical drawings of .
October 14, 2026 partial results
A report dated October 14, 2026 describes Alfredo Hubard, Cheikh Saliou Ndiaye, and Oriol Solé-Pi's paper on crossing numbers of simplicial complexes in Euclidean and spherical spaces. It supplies structural and probabilistic evidence for generalized Harary–Hill-type statements and new graph-case results, but explicitly presents these as partial results rather than a complete proof.
Current status (as of October 2026): Special cases and supporting results are established, while the full Linhart–Eckhoff–Welzl conjecture and the broader generalized crossing-number conjectures remain open.
Sources
Solutions 0
No solutions have been posted yet.