  In this paper it is shown that a complete graph with $n$ vertices has an
optimal diagram, i.e., a diagram whose crossing number equals the value of
Guy's formula, with a free maximal linear tree and without free hamiltonian
cycles for any odd integer $n \ge 7$.
