Computational search of small point sets with small rectilinear crossing number

Ruy Fabila-Monroy, Jorge López

Let $\crs(K_n)$ be the minimum number of crossings over all rectilinear drawings of the complete graph on $n$ vertices on the plane. In this paper we prove that $\crs(K_n) < 0.3804…