Rectilinear crossing number $\overline{\mathrm{cr}}(K_{100})$
The fewest crossings in a drawing of the complete graph $K_{100}$ in the plane with straight edges and no three vertices on a line.
Lower bound:
$1459912$
(1,459,912)
Literature
Upper bound:
$1463457$
(1,463,457)
Checked construction
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| undated | $\le 1463457$ (1,463,457) |
Reference unknown
[via O. Aichholzer, On the rectilinear crossing number, web page, TU Graz, table last modified 2015-05-26.] |
Checked construction
Certificate rectilinear-crossing-100-upper-1463457, submitted by daniel-munro, 2026-11-17 [construction from O. Aichholzer, On the rectilinear crossing number, web page, TU Graz, table last modified 2015-05-26.] |
| 2015-05-26 | $\ge 1459912$ (1,459,912) | O. Aichholzer, On the rectilinear crossing number, web page, TU Graz, table last modified 2015-05-26. | Literature |