The number of crossings in a regular drawing of the complete bipartite graph
J. Integer Seq. 12(5), Article ID 09.5.5, 8 p., electronic only (2009)
Summary
Summary: The regular drawing of the complete bipartite graph $K_{n,n}$ produces a striking pattern comprising simple and multiple crossings. We compute the number $c(n)$ of crossings and give an asymptotic estimate for this sequence.
