The crossing number of complete bipartite graphs
For all positive integers , the ordinary crossing number of the complete bipartite graph is .
Every step of the upper bound, the odd-n lower bound (via Lemma A.1, Lemma 3.2, Lemma 4.2, and Corollary 2.3), and the even-n vertex-deletion reduction is completely and rigorously proved.
“Theorem 1.1. For all positive integers m, n, cr(Km,n) = dmdn.” · Show in paper