The crossing number of complete graphs
For every integer , the ordinary crossing number of the complete graph is , resolving the Harary–Hill conjecture positively.
Both the lower bound (Corollary 4.4) and the matching upper bound (Proposition 5.1) are rigorously proved, directly establishing Theorem 1.1.
“Theorem 1.1. For every integer n ≥ 3, cr(Kn) = Z(n) := 1/4 ⌊n/2⌋ ⌊(n-1)/2⌋ ⌊(n-2)/2⌋ ⌊(n-3)/2⌋. Thus Theorem 1.1 resolves the Harary–Hill conjecture positively.” · Show in paper