Using Block Designs in Crossing Number Bounds

John Asplund, Eva Czabarka, Gregory Clark +6

The crossing number ${\mbox {cr}}(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing…