English

Bad drawings of small complete graphs

Combinatorics 2019-03-18 v1

Abstract

We show that for K5K_5 (resp.~ K3,3K_{3,3}) there is a drawing with ii independent crossings, and no pair of independent edges cross more than once, provided ii is odd with 1i151\le i\le 15 (resp.~ 1i171\le i\le 17). Conversely, using the deleted product cohomology, we show that for K5K_5 and K3,3K_{3,3}, if AA is any set of pairs of independent edges, and AA has odd cardinality, then there is a drawing in the plane for which each element in AA cross an odd number of times, while each pair of independent edges not in AA cross an even number of times. For K6K_6 we show that there is a drawing with ii independent crossings, and no pair of independent edges cross more than once, if and only if 3i403\le i\le 40.

Keywords

Cite

@article{arxiv.1903.06292,
  title  = {Bad drawings of small complete graphs},
  author = {Grant Cairns and Emily Groves and Yuri Nikolayevsky},
  journal= {arXiv preprint arXiv:1903.06292},
  year   = {2019}
}
R2 v1 2026-06-23T08:08:46.690Z