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

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

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

Value: $36$ 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
1972 $\ge 36$ R.K. Guy, Crossing numbers of graphs, in Graph Theory and Applications (Proc. Conf., Western Michigan Univ., 1972), Lecture Notes in Math. 303, Springer, Berlin, 1972, pp. 111-124.
[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
1972 $\le 36$ R.K. Guy, Crossing numbers of graphs, in Graph Theory and Applications (Proc. Conf., Western Michigan Univ., 1972), Lecture Notes in Math. 303, Springer, Berlin, 1972, pp. 111-124.
[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-9-upper-36, submitted by daniel-munro, 2026-11-12
[construction from R.K. Guy, Crossing numbers of graphs, in Graph Theory and Applications (Proc. Conf., Western Michigan Univ., 1972), Lecture Notes in Math. 303, Springer, Berlin, 1972, pp. 111-124.]