Bounding the number of non-duplicates of the $q$-side in simple drawings of $K_{p,q}$

R. Bruce Richter, André C. Silva, Orlando Lee

The number $Z(n):=\lfloor n/2\rfloor \lfloor (n-1)/2\rfloor$ is the smallest number of crossings in a simple planar drawing of $K_{2,n}$ in which both vertices on the 2-side have th…