{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:06:00Z","timestamp":1750910760680,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00493-025-00139-1","type":"journal-article","created":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T06:15:41Z","timestamp":1748240141000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Number of Digons in Arrangements of Pairwise Intersecting Circles"],"prefix":"10.1007","volume":"45","author":[{"given":"Eyal","family":"Ackerman","sequence":"first","affiliation":[]},{"given":"G\u00e1bor","family":"Dam\u00e1sdi","sequence":"additional","affiliation":[]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[]},{"given":"Rom","family":"Pinchasi","sequence":"additional","affiliation":[]},{"given":"Rebeka","family":"Raffay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,26]]},"reference":[{"key":"139_CR1","unstructured":"Ackerman, E., Dam\u00e1sdi, G., Keszegh, B., Pinchasi, R., Raffay, R.: The maximum number of digons formed by pairwise crossing pseudocircles. arXiv:2412.10023 (2024)"},{"key":"139_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/972639.972641","volume":"51","author":"P Agarwal","year":"2004","unstructured":"Agarwal, P., Nevo, E., Pach, J., Pinchasi, R., Sharir, M., Smorodinsky, S.: Lenses in arrangements of pseudocircles and their applications. J. ACM 51, 139\u2013186 (2004)","journal-title":"J. ACM"},{"key":"139_CR3","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00454-001-0043-x","volume":"26","author":"N Alon","year":"2001","unstructured":"Alon, N., Last, H., Pinchasi, R., Sharir, M.: On the complexity of arrangements of circles in the plane. Discret. Comput. Geom. 26, 465\u2013492 (2001)","journal-title":"Discret. Comput. Geom."},{"key":"139_CR4","first-page":"22","volume":"18","author":"J Ellenberg","year":"2016","unstructured":"Ellenberg, J., Solymosi, J., Zahl, J.: New bounds on curve tangencies and orthogonalities. Discret. Anal. 18, 22 (2016)","journal-title":"Discret. Anal."},{"key":"139_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1080\/00029890.1946.11991674","volume":"53","author":"P Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P.: On sets of distances of $$n$$ points. Am. Math. Mon. 53, 248\u2013250 (1946)","journal-title":"Am. Math. Mon."},{"key":"139_CR6","first-page":"441","volume":"13764","author":"S Felsner","year":"2023","unstructured":"Felsner, S., Roch, S., Scheucher, M.: Arrangements of pseudocircles: on digons and triangles. Graph Draw. Netw. Vis. 13764, 441\u2013455 (2023)","journal-title":"Graph Draw. Netw. Vis."},{"key":"139_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00454-020-00173-4","volume":"65","author":"S Felsner","year":"2021","unstructured":"Felsner, S., Scheucher, M.: Arrangements of pseudocircles: triangles and drawings. Discret. Comput. Geom. 65, 261\u2013278 (2021)","journal-title":"Discret. Comput. Geom."},{"key":"139_CR8","unstructured":"Handbook of discrete and computational geometry. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Discrete Mathematics and Its Applications (Boca Raton), 3rd edn. CRC Press, Boca Raton, FL (2018)"},{"key":"139_CR9","volume-title":"Arrangements and Spreads, CBMS Regional Conference Series in Mathematics","author":"B Gr\u00fcnbaum","year":"1972","unstructured":"Gr\u00fcnbaum, B.: Arrangements and Spreads, CBMS Regional Conference Series in Mathematics, vol. 10. AMS, Providence (1972)"},{"issue":"no. 3, Special","key":"139_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/PL00009357","volume":"19","author":"M Katchalski","year":"1998","unstructured":"Katchalski, M., Last, H.: On geometric graphs with no two edges in convex position. Dedicated to the memory of Paul Erd\u0151s. Discret. Comput. Geom. 19(3, Special Issue), 399\u2013404 (1998)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"139_CR11","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.jcta.2005.07.002","volume":"113","author":"A Marcus","year":"2006","unstructured":"Marcus, A., Tardos, G.: Intersection reverse sequences and geometric applications. J. Combin. Theory Ser. A 113(4), 675\u2013691 (2006)","journal-title":"J. Combin. Theory Ser. A"},{"key":"139_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02773960","volume":"155","author":"J Pach","year":"2006","unstructured":"Pach, J., Tardos, G.: Forbidden paths and cycles in ordered graphs and matrices. Isr. J. Math. 155, 359\u2013380 (2006)","journal-title":"Isr. J. Math."},{"issue":"1","key":"139_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00493-008-2250-z","volume":"28","author":"R Pinchasi","year":"2008","unstructured":"Pinchasi, R.: Geometric graphs with no two parallel edges. Combinatorica 28(1), 127\u2013130 (2008)","journal-title":"Combinatorica"},{"key":"139_CR14","unstructured":"Pinchasi, R.: A note on lenses in arrangements of pairwise intersecting circles in the plane. Electron. J. Comb. (Accepted)"},{"key":"139_CR15","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00454-002-2892-3","volume":"28","author":"R Pinchasi","year":"2002","unstructured":"Pinchasi, R.: Gallai-Sylvester theorem for pairwise intersecting unit circles. Discret. Comput. Geom. 28, 607\u2013624 (2002)","journal-title":"Discret. Comput. Geom."},{"key":"139_CR16","doi-asserted-by":"crossref","unstructured":"Pinchasi, R., Radoi\u010di\u0107, R.: On the number of edges in a topological graph with no self-intersecting cycle of length $$4$$. In: Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342, pp. 233\u2013243. American Mathematical Society, Providence, RI (2004)","DOI":"10.1090\/conm\/342\/06143"},{"key":"139_CR17","unstructured":"Spencer, J., Szemer\u00e8di, E., Trotter, W.: Unit distances in the Euclidean plane. In: Graph Theory and Combinatorics (Cambridge, 1983), 293\u2013303, Academic Press, London, 1984"},{"key":"139_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.: Crossing numbers and hard Erdos problems in discrete geometry. Comb. Probab. Comput. 6, 353\u2013358 (1997)","journal-title":"Comb. Probab. Comput."},{"issue":"no. 3, Special","key":"139_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P Valtr","year":"1998","unstructured":"Valtr, P.: On geometric graphs with no $$k$$ pairwise parallel edges. Discret. Comput. Geom. 19(3, Special Issue), 461\u2013469 (1998)","journal-title":"Discret. Comput. Geom."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00139-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00139-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00139-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:15:30Z","timestamp":1750857330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00139-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["139"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00139-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2025,5,26]]},"assertion":[{"value":"30 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"30"}}