TY - GEN
T1 - On the Richter-Thomassen conjecture about pairwise intersecting closed curves
AU - Pach, Janos
AU - Rubin, Natan
AU - Tardos, Gabor
N1 - Publisher Copyright:
Copyright © 2015 by the Society for Industrial and Applied Mathmatics.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - 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 ℝ, 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 √logt/log log t).
AB - 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 ℝ, 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 √logt/log log t).
UR - https://www.scopus.com/pages/publications/84938242774
U2 - 10.1137/1.9781611973730.99
DO - 10.1137/1.9781611973730.99
M3 - Conference contribution
AN - SCOPUS:84938242774
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 1506
EP - 1516
BT - Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015
PB - Association for Computing Machinery
T2 - 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015
Y2 - 4 January 2015 through 6 January 2015
ER -