Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems
Combinatorics
2022-12-05 v1 Computational Geometry
Abstract
Given a complete simple topological graph , a -face generated by is the open bounded region enclosed by the edges of a non-self-intersecting -cycle in . Interestingly, there are complete simple topological graphs with the property that every odd face it generates contains the origin. In this paper, we show that every complete -vertex simple topological graph generates at least pairwise disjoint 4-faces. As an immediate corollary, every complete simple topological graph on vertices drawn in the unit square generates a 4-face with area at most . Finally, we investigate a variant of Heilbronn triangle problem.
Keywords
Cite
@article{arxiv.2212.01311,
title = {Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems},
author = {Alfredo Hubard and Andrew Suk},
journal= {arXiv preprint arXiv:2212.01311},
year = {2022}
}