A Crossing Lemma for Jordan curves

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 touching point. The main result of this paper is a Crossing Lemma for simple curves: Let X and T stand for the sets of intersection points and touching points, respectively, in a family of n simple curves in the plane, no three of which pass through the same point. If vertical bar T vertical bar > cn, for some fixed constant c > 0, then we prove that vertical bar X vertical bar = Omega(vertical bar T vertical bar(log log(vertical bar T vertical bar/n))(1/504)). In particular, if vertical bar T vertical bar/n -> infinity, 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 n pairwise intersecting simple closed (i.e., Jordan) curves in the plane, no three of which pass through the same point, is at least (1 - o(1))n(2). (C) 2018 Published by Elsevier Inc.