The Harary-Hill Conjecture states that the crossing number of complete graph Kn is
Instead of looking at all possible drawings (which is infinite), we can partition the drawings into classes, depending on the rotation system of the drawing.
The following theorem guarantees us that the crossing number is still well-defined.
Gioan’s Theorem. Let D1 and D2 be two drawing of graph Kn in the plane. Then one can transform D1 into D2 using only -moves. As a corollary, the crossing number of D1 and D2 is the same.
Noted that in general this is not true when the graph is not complete.