Abstract
We prove that the number of tangencies between the members of two families, each of which consists of pairwise disjoint curves, can be as large as . We show that from a conjecture about forbidden - matrices it would follow that this bound is sharp for doubly-grounded families. We also show that if the curves are required to be -monotone, then the maximum number of tangencies is , which improves a result by Pach, Suk, and Treml. Finally, we also improve the best known bound on the number of tangencies between the members of a family of at most -intersecting curves.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.