The $2nd-$convex hull of every optimal rectilinear drawing of $K_n$ is a triangle

J. Leaños, M. Lomeli, M. Ramírez-Ibáñez +1

A rectilinear drawing of a graph $G$ is optimal if it has the smallest number of crossings among all rectilinear drawings of $G$. In this paper it is shown that for $n\ge 8$, the…