On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any n simple closed Jordan curves in the plane, so that any two of them intersect and no three curves pass through the same point, is at least (1 − o(1))n2. We confirm the above conjecture in several important cases, including the case (1) when all curves are convex, and (2) when the family of curves can be partitioned into two equal classes such that each curve from the first class is touching every curve from the second class. (Two curves are said to be touching if they have precisely one point in common, at which they do not properly cross.) An important ingredient of our proofs is the following statement: Let S be a family of the graphs of n continuous real functions defined on R, no three of which pass through the same point. If there are nt pairs of touching curves in S, then the number of crossing points is Ω(nt[EQUATION]log t/log log t).

[1]  Micha Shahir.  Combinatorial Geometry and its Algorithmic Applications by Janos Pach and , 2011 .

[2]  Haim Kaplan,et al.  Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique , 2011, Discret. Comput. Geom..

[3]  Micha Sharir,et al.  Pseudo-line arrangements: duality, algorithms, and applications , 2002, SODA '02.

[4]  László A. Székely,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[5]  Hisao Tamaki,et al.  How to Cut Pseudoparabolas into Segments , 1998, Discret. Comput. Geom..

[6]  Micha Sharir,et al.  Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces , 2002, Discret. Comput. Geom..

[7]  P. Erdös.  On Sets of Distances of n Points , 1946 .

[8]  L. A. Oa,et al.  Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[9]  Endre Szemerédi,et al.  A Combinatorial Distinction Between the Euclidean and Projective Planes , 1983, Eur. J. Comb..

[10]  Carsten Thomassen,et al.  Intersections of curve systems and the crossing number ofC5×C5 , 1995, Discret. Comput. Geom..

[11]  Gábor Tardos,et al.  Intersection reverse sequences and geometric applications , 2004, J. Comb. Theory, Ser. A.

[12]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[13]  Timothy M. Chan.  On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences , 2005, Discret. Comput. Geom..

[14]  Gelasio Salazar,et al.  On the Intersections of Systems of Curves , 1999, J. Comb. Theory, Ser. B.

[15]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[16]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[17]  Dhruv Mubayi.  Intersecting Curves in the Plane , 2002, Graphs Comb..

[18]  János Pach,et al.  Crossings between Curves with Many Tangencies , 2010, WALCOM.

[19]  H. Halkin,et al.  Discretional Convexity and the Maximum Principle for Discrete Systems , 1966 .

[20]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[21]  Timothy M. Chan.  On levels in arrangements of curves , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[22]  József Solymosi,et al.  An Incidence Theorem in Higher Dimensions , 2012, Discret. Comput. Geom..

[23]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[24]  Timothy M. Chan.  On levels in arrangements of curves, iii: further improvements , 2008, SCG '08.

[25]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[26]  Micha Sharir,et al.  Lenses in arrangements of pseudo-circles and their applications , 2004, JACM.