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

A straight-line drawing of the complete graph on 5 points with 1 crossing, the fewest possible, marked in orange

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

Value: $1$ 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
undated $\ge 1$ Trivial or easy according to the secondary source.
[via A. Brodsky, S. Durocher, E. Gethner, The rectilinear crossing number of K_10 is 62, Electron. J. Combin. 8 (2001) #R23, arXiv:cs/0009023.]
Literature
undated $\le 1$ Trivial or easy according to the secondary source.
[via A. Brodsky, S. Durocher, E. Gethner, The rectilinear crossing number of K_10 is 62, Electron. J. Combin. 8 (2001) #R23, arXiv:cs/0009023.]
Checked construction
Certificate rectilinear-crossing-5-upper-1, submitted by daniel-munro, 2026-11-12