Non-homotopic Loops with a Bounded Number of Pairwise Intersections
Abstract
Let be a set of points in the plane and let . An -loop is a continuous closed curve not containing any point of . We say that two -loops are non-homotopic if they cannot be transformed continuously into each other without passing through a point of . For , we give an upper bound on the maximum size of a family of pairwise non-homotopic -loops such that every loop has fewer than self-intersections and any two loops have fewer than intersections. The exponent is asymptotically tight. The previous upper bound bound was proved by Pach, Tardos, and T\'oth [Graph Drawing 2020]. We prove the above result by proving the asymptotic upper bound for a similar problem when , and by proving a close relation between the two problems.
Keywords
Cite
@article{arxiv.2108.13953,
title = {Non-homotopic Loops with a Bounded Number of Pairwise Intersections},
author = {Václav Blažej and Michal Opler and Matas Šileikis and Pavel Valtr},
journal= {arXiv preprint arXiv:2108.13953},
year = {2021}
}
Comments
Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)