Rectilinear crossing number $\overline{\mathrm{cr}}(K_{35})$
The fewest crossings in a drawing of the complete graph $K_{35}$ in the plane with straight edges and no three vertices on a line.
Lower bound:
$18796$
(18,796)
Literature
Upper bound:
$18808$
(18,808)
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 18808$ (18,808) |
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-35-upper-18808, 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.] |
| 2011-02-24 | $\ge 18796$ (18,796) |
B.M. Ábrego, M. Cetina, S. Fernández-Merchant, J. Leaños, G. Salazar, On (<= k)-edges, crossings, and halving lines of geometric drawings of K_n, Discrete Comput. Geom. 48 (2012) 192-215, arXiv:1102.5065.
[via O. Aichholzer, On the rectilinear crossing number, web page, TU Graz, table last modified 2015-05-26.] |
Literature |