Rectilinear crossing number $\overline{\mathrm{cr}}(K_{18})$
The fewest crossings in a drawing of the complete graph $K_{18}$ in the plane with straight edges and no three vertices on a line.
Value: $1029$
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 |
| 2008-02 |
$\ge 1029$
|
B.M. Ábrego, S. Fernández-Merchant, J. Leaños, G. Salazar, The maximum number of halving lines and the rectilinear crossing number of K_n for n <= 27, Electron. Notes Discrete Math. 30 (2008) 261-266.
[via 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.]
|
Literature
|
| 2008-02 |
$\le 1029$
|
B.M. Ábrego, S. Fernández-Merchant, J. Leaños, G. Salazar, The maximum number of halving lines and the rectilinear crossing number of K_n for n <= 27, Electron. Notes Discrete Math. 30 (2008) 261-266.
[via 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.]
|
Checked construction
Certificate rectilinear-crossing-18-upper-1029,
submitted by daniel-munro, 2026-11-12
[construction from B.M. Ábrego, S. Fernández-Merchant, J. Leaños, G. Salazar, The maximum number of halving lines and the rectilinear crossing number of K_n for n <= 27, Electron. Notes Discrete Math. 30 (2008) 261-266.]
|