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

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

Lower bound: $1346029$ (1,346,029) Literature
Upper bound: $1347559$ (1,347,559) 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.