Bad drawings of small complete graphs

Grant Cairns, Emily Groves, Yuri Nikolayevsky

We show that for $K_5$ (resp.~ $K_{3,3}$) there is a drawing with $i$ independent crossings, and no pair of independent edges cross more than once, provided $i$ is odd with $1\le i…