## Abstract

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))n^{2}. 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).

Original language | English |
---|---|

Title of host publication | Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015 |

Publisher | Association for Computing Machinery |

Pages | 1506-1516 |

Number of pages | 11 |

Volume | 2015-January |

ISBN (Electronic) | 9781611973747 |

DOIs | |

State | Published - 1 Jan 2015 |

Event | 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015 - San Diego, United States Duration: 4 Jan 2015 → 6 Jan 2015 |

### Conference

Conference | 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015 |
---|---|

Country/Territory | United States |

City | San Diego |

Period | 4/01/15 → 6/01/15 |

## ASJC Scopus subject areas

- Software
- Mathematics (all)