English

A Crossing Lemma for Jordan Curves

Combinatorics 2017-08-08 v1 Computational Geometry

Abstract

If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a {\em touching point}. The main result of this paper is a Crossing Lemma for simple curves: Let XX and TT stand for the sets of intersection points and touching points, respectively, in a family of nn simple curves in the plane, no three of which pass through the same point. If T>cn|T|>cn, for some fixed constant c>0c>0, then we prove that X=Ω(T(loglog(T/n))1/504)|X|=\Omega(|T|(\log\log(|T|/n))^{1/504}). In particular, if T/n|T|/n\rightarrow\infty, then the number of intersection points is much larger than the number of touching points. As a corollary, we confirm the following long-standing conjecture of Richter and Thomassen: The total number of intersection points between nn pairwise intersecting simple closed (i.e., Jordan) curves in the plane, no three of which pass through the same point, is at least (1o(1))n2(1-o(1))n^2.

Keywords

Cite

@article{arxiv.1708.02077,
  title  = {A Crossing Lemma for Jordan Curves},
  author = {János Pach and Natan Rubin and Gábor Tardos},
  journal= {arXiv preprint arXiv:1708.02077},
  year   = {2017}
}

Comments

A preliminary version [arXiv:1504.08250], with a somewhat too optimistic bound for the pairwise-intersecting case, has appeared in proceedings of SODA 2016

R2 v1 2026-06-22T21:08:30.651Z