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

A straight-line drawing of the complete graph on 12 points with 153 crossings, the fewest possible, marked in orange

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

Value: $153$ 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
2002-06 $\ge 153$ O. Aichholzer, F. Aurenhammer, H. Krasser, On the crossing number of complete graphs, Proc. 18th ACM Symposium on Computational Geometry (2002) 19-24; Computing 76 (2006) 165-176.
[via Rectilinear crossing number of complete graph on n nodes. - OEIS]
Literature
2002-06 $\le 153$ O. Aichholzer, F. Aurenhammer, H. Krasser, On the crossing number of complete graphs, Proc. 18th ACM Symposium on Computational Geometry (2002) 19-24; Computing 76 (2006) 165-176.
[via Rectilinear crossing number of complete graph on n nodes. - OEIS]
Checked construction
Certificate rectilinear-crossing-12-upper-153, submitted by daniel-munro, 2026-11-12
[construction from O. Aichholzer, F. Aurenhammer, H. Krasser, On the crossing number of complete graphs, Proc. 18th ACM Symposium on Computational Geometry (2002) 19-24; Computing 76 (2006) 165-176.]