New lower bounds on crossing numbers of $K_{m,n}$ from semidefinite programming

Daniel Brosch, Sven Polak

In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph $K_{m,n}$, extending a m…