Rectilinear crossing number $\overline{\mathrm{cr}}(K_{19})$
The fewest crossings in a drawing of the complete graph $K_{19}$ in the plane with straight edges and no three vertices on a line.
Value: $1318$ lower bound Literature upper bound 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 |
|---|---|---|---|
| 2006-08-24 | $\ge 1318$ | O. Aichholzer, J. García, D. Orden, P. Ramos, New lower bounds for the number of (<= k)-edges and the rectilinear crossing number of K_n, Discrete Comput. Geom. 38 (2007) 1-14, arXiv:math/0608610. | Literature |
| 2006-08-24 | $\le 1318$ | O. Aichholzer, J. García, D. Orden, P. Ramos, New lower bounds for the number of (<= k)-edges and the rectilinear crossing number of K_n, Discrete Comput. Geom. 38 (2007) 1-14, arXiv:math/0608610. |
Checked construction
Certificate rectilinear-crossing-19-upper-1318, submitted by daniel-munro, 2026-11-12 [construction from O. Aichholzer, J. García, D. Orden, P. Ramos, New lower bounds for the number of (<= k)-edges and the rectilinear crossing number of K_n, Discrete Comput. Geom. 38 (2007) 1-14, arXiv:math/0608610.] |