Rectilinear crossing number $\overline{\mathrm{cr}}(K_{30})$

The fewest crossings in a drawing of the complete graph $K_{30}$ in the plane with straight edges and no three vertices on a line.

Value: $9726$ 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
2005-06 $\le 9726$ O. Aichholzer, H. Krasser, Abstract order type extension and new results on the rectilinear crossing number, Proc. 21st ACM Symposium on Computational Geometry (2005) 91-98; Comput. Geom. 36 (2007) 2-15.
[via M. Cetina, C. Hernández-Vélez, J. Leaños, C. Villalobos, Point sets that minimize (<= k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K_30, Discrete Math. 311 (2011) 1646-1657, arXiv:1009.4736.]
Checked construction
Certificate rectilinear-crossing-30-upper-9726, submitted by daniel-munro, 2026-11-12
[construction from O. Aichholzer, H. Krasser, Abstract order type extension and new results on the rectilinear crossing number, Proc. 21st ACM Symposium on Computational Geometry (2005) 91-98; Comput. Geom. 36 (2007) 2-15.]
2010-09-23 $\ge 9726$ M. Cetina, C. Hernández-Vélez, J. Leaños, C. Villalobos, Point sets that minimize (<= k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K_30, Discrete Math. 311 (2011) 1646-1657, arXiv:1009.4736. Literature