  A drawing of a graph G in the plane is said to be a rectilinear drawing of G
if the edges are required to be line segments (as opposed to Jordan curves). We
assume no three vertices are collinear. The rectilinear crossing number of G is
the fewest number of edge crossings attainable over all rectilinear drawings of
G. Thanks to Richard Guy, exact values of the rectilinear crossing number of
K_n, the complete graph on n vertices, for n = 3,...,9, are known (Guy 1972,
White and Beinke 1978, Finch 2000, Sloanes A014540). Since 1971, thanks to the
work of David Singer (1971, Gardiner 1986), the rectilinear crossing number of
K_10 has been known to be either 61 or 62, a deceptively innocent and
tantalizing statement. The difficulty of determining the correct value is
evidenced by the fact that Singer's result has withstood the test of time. In
this paper we use a purely combinatorial argument to show that the rectilinear
crossing number of K_10 is 62. Moreover, using this result, we improve an
asymptotic lower bound for a related problem. Finally, we close with some new
and old open questions that were provoked, in part, by the results of this
paper, and by the tangled history of the problem itself.

Discrete Mathematics;Combinatorics