Publication at Faculty of Mathematics and Physics |
2022
Abstract
A star-simple drawing of a graph is a drawing in which adjacent edges do not cross. In contrast, there is no restriction on the number of crossings between two independent edges.
We forbid empty lenses, i.e., every lens is required to enclose a vertex, and show that with this restriction 3 · (n − 4)! is an upper bound on the number of crossings between two edges of a star-simple drawing of Kn. It follows that n! bounds the total number of crossings in the drawing.
This is the first finite upper bound on the number of crossings in star-simple drawings of the complete graph Kn with no empty lens. For a lower bound we construct a star-simple drawing of Kn with no empty lens in which a pair of edges contributes 5^{n/2−2} crossings.