Bad drawings of small complete graphs
Combinatorics
2019-03-18 v1
Abstract
We show that for (resp.~ ) there is a drawing with independent crossings, and no pair of independent edges cross more than once, provided is odd with (resp.~ ). Conversely, using the deleted product cohomology, we show that for and , if is any set of pairs of independent edges, and has odd cardinality, then there is a drawing in the plane for which each element in cross an odd number of times, while each pair of independent edges not in cross an even number of times. For we show that there is a drawing with independent crossings, and no pair of independent edges cross more than once, if and only if .
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}
}