pith. sign in

arxiv: 1903.06292 · v1 · pith:NPZS3MSNnew · submitted 2019-03-14 · 🧮 math.CO

Bad drawings of small complete graphs

classification 🧮 math.CO
keywords independentcrossedgesdrawingpairtherecrossingsnumber
0
0 comments X
read the original abstract

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\le 15$ (resp.~ $1\le i\le 17$). Conversely, using the deleted product cohomology, we show that for $K_5$ and $K_{3,3}$, if $A$ is any set of pairs of independent edges, and $A$ has odd cardinality, then there is a drawing in the plane for which each element in $A$ cross an odd number of times, while each pair of independent edges not in $A$ cross an even number of times. For $K_6$ we show that there is a drawing with $i$ independent crossings, and no pair of independent edges cross more than once, if and only if $3\le i\le 40$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.