{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:10Z","timestamp":1759335490393},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T00:00:00Z","timestamp":1462320000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p>A long-standing conjecture of Richter and Thomassen states that the total number of intersection points between any <jats:italic>n<\/jats:italic> simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same point, is at least (1\u2212<jats:italic>o<\/jats:italic>(1))<jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>.<\/jats:p><jats:p>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 touches every curve from the second class. (Two closed or open curves are said to be touching if they have precisely one point in common and at this point the two curves do not properly cross.)<\/jats:p><jats:p>An important ingredient of our proofs is the following statement. Let <jats:italic>S<\/jats:italic> be a family of <jats:italic>n<\/jats:italic> open curves in \u211d<jats:sup>2<\/jats:sup>, so that each curve is the graph of a continuous real function defined on \u211d, and no three of them pass through the same point. If there are <jats:italic>nt<\/jats:italic> pairs of touching curves in <jats:italic>S<\/jats:italic>, then the number of crossing points is <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0963548316000043_inline1\" \/><jats:tex-math>$\\Omega(nt\\sqrt{\\log t\/\\log\\log t})$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1017\/s0963548316000043","type":"journal-article","created":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T06:34:55Z","timestamp":1462343695000},"page":"941-958","source":"Crossref","is-referenced-by-count":3,"title":["On the Richter\u2013Thomassen Conjecture about Pairwise Intersecting Closed Curves"],"prefix":"10.1017","volume":"25","author":[{"given":"J\u00c1NOS","family":"PACH","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NATAN","family":"RUBIN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00c1BOR","family":"TARDOS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,5,4]]},"reference":[{"key":"S0963548316000043_ref7","doi-asserted-by":"crossref","unstructured":"Chan T. M. (2008) On levels in arrangements of curves III: Further improvements. In Proc. 24th ACM Symposium on Computational Geometry: SoCG, pp. 85\u201393.","DOI":"10.1145\/1377676.1377691"},{"key":"S0963548316000043_ref17","doi-asserted-by":"crossref","unstructured":"Pach J. , Rubin N. and Tardos G. Beyond the Richter\u2013Thomassen conjecture. In Proc. 27th Annual ACM\u2013SIAM Symposium on Discrete Algorithms: SODA 2016, pp. 957\u2013968.","DOI":"10.1137\/1.9781611974331.ch68"},{"key":"S0963548316000043_ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1858"},{"key":"S0963548316000043_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.07.002"},{"key":"S0963548316000043_ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0304023"},{"key":"S0963548316000043_ref1","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972641"},{"key":"S0963548316000043_ref16","volume-title":"Combinatorial Geometry and its Algorithmic Applications: The Alcal\u00e1 Lectures","author":"Pach","year":"2009"},{"key":"S0963548316000043_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9"},{"key":"S0963548316000043_ref15","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s003730200042","article-title":"Intersecting curves in the plane","volume":"18","author":"Mubayi","year":"2002","journal-title":"Graphs Combin."},{"key":"S0963548316000043_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579194"},{"key":"S0963548316000043_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187683"},{"key":"S0963548316000043_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1165-3"},{"key":"S0963548316000043_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9443-3"},{"key":"S0963548316000043_ref10","first-page":"1","volume-title":"WALCOM: Algorithms and Computation","author":"Fox","year":"2010"},{"key":"S0963548316000043_ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2305092"},{"key":"S0963548316000043_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9420-x"},{"key":"S0963548316000043_ref20","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"Sharir","year":"1995"},{"key":"S0963548316000043_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009345"},{"key":"S0963548316000043_ref26","volume-title":"Additive Combinatorics","author":"Tao","year":"2010"},{"key":"S0963548316000043_ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433900"},{"key":"S0963548316000043_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574034"},{"key":"S0963548316000043_ref4","volume-title":"Research Problems in Discrete Geometry","author":"Brass","year":"2005"},{"key":"S0963548316000043_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-002-2840-2"},{"key":"S0963548316000043_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(83)80036-5"},{"key":"S0963548316000043_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397002976"},{"key":"S0963548316000043_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0084-1"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548316000043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T20:59:36Z","timestamp":1555621176000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548316000043\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,4]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["S0963548316000043"],"URL":"https:\/\/doi.org\/10.1017\/s0963548316000043","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,4]]}}}