{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:29:50Z","timestamp":1764361790477,"version":"3.46.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:00:00Z","timestamp":1740009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:00:00Z","timestamp":1740009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1800746","DMS-1952786","DMS-2246847"],"award-info":[{"award-number":["DMS-1800746","DMS-1952786","DMS-2246847"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00454-025-00721-w","type":"journal-article","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:26:48Z","timestamp":1740054408000},"page":"899-916","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Alfredo","family":"Hubard","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Suk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"721_CR1","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Garc\u00eda, A., Tejel, J., Vogtenhuber, B., Weinberger, A.: Twisted ways to find plane structures in simple drawings of complete graphs. In: Proc. 38th Symp. Comput. Geometry, LIPIcs, Dagstuhl, Germany, pp. 5:1\u20135:18 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2022.5","DOI":"10.4230\/LIPIcs.SoCG.2022.5"},{"key":"721_CR2","doi-asserted-by":"publisher","unstructured":"Arroyo, A., Derka, M., Parada, I.: Extending simple drawings. In: Archambault, D., T\u00f3th, C.D. (eds.) Graph Drawing and Network Visualization. GD 2019. Lecture Notes in Computer Science, vol. 11904, pp. 230\u2013243. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_18","DOI":"10.1007\/978-3-030-35802-0_18"},{"key":"721_CR3","volume-title":"What is Mathematics?","author":"R Courant","year":"1941","unstructured":"Courant, R., Robbins, H.: What is Mathematics? Oxford University Press, Oxford (1941)"},{"key":"721_CR4","doi-asserted-by":"publisher","unstructured":"Erd\u0151s, P.: Problems and results in combinatorial geometry, in: Discrete Geometry and Convexity, J.E. Goodman et al., eds. Ann. N. Y. Acad. Sci. 440, 1\u201311 (1985). https:\/\/doi.org\/10.1111\/j.1749-6632.1985.tb14533.x","DOI":"10.1111\/j.1749-6632.1985.tb14533.x"},{"key":"721_CR5","doi-asserted-by":"publisher","unstructured":"Fulek, R., Ruiz-Vargas, A.J.: Topological graphs: empty triangles and disjoint matchings. In: Proc. 29th Annual Symposium on Computational Geometry (SoCG\u201913), pp. 259\u2013266 (2013). https:\/\/doi.org\/10.1145\/2462356.246239","DOI":"10.1145\/2462356.246239"},{"key":"721_CR6","volume-title":"Differentiable Geometry","author":"V Gullemin","year":"1974","unstructured":"Gullemin, V., Pollock, A.: Differentiable Geometry. American Mathematical Society, Chelsea Publishing, Providence (1974)"},{"key":"721_CR7","first-page":"225","volume":"88","author":"H Harborth","year":"1992","unstructured":"Harborth, H., Mengersen, I.: Drawings of the complete graph with maximum number of crossings. Congr. Numer. 88, 225\u2013228 (1992)","journal-title":"Congr. Numer."},{"key":"721_CR8","doi-asserted-by":"publisher","unstructured":"Hoffmann, M., Liu, C.H., Reddy, M.M., T\u00f3th, C.D.: Simple topological drawings of $$k$$-planar graphs. In: Auber, D., Valtr , P. (eds.) Graph Drawing and Network Visualization. GD 2020. Lecture Notes in Computer Science, vol. 12590, pp. 390\u2013402. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_31","DOI":"10.1007\/978-3-030-68766-3_31"},{"key":"721_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1112\/jlms\/s2-25.1.13","volume":"25","author":"J Koml\u00f3s","year":"1982","unstructured":"Koml\u00f3s, J., Pintz, J., Szemer\u00e9di, E.: A lower bound for Heilbronn\u2019s problem. J. Lond. Math. Soc. 25, 13\u201324 (1982). https:\/\/doi.org\/10.1112\/jlms\/s2-25.1.13","journal-title":"J. Lond. Math. Soc."},{"key":"721_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/jlms\/s2-24.3.385","volume":"24","author":"J Koml\u00f3s","year":"1981","unstructured":"Koml\u00f3s, J., Pintz, J., Szemer\u00e9di, E.: On Heilbronn\u2019s triangle problem. J. Lond. Math. Soc. 24, 385\u2013396 (1981). https:\/\/doi.org\/10.1112\/jlms\/s2-24.3.385","journal-title":"J. Lond. Math. Soc."},{"key":"721_CR11","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.ejc.2007.11.021","volume":"29","author":"H Lefmann","year":"2008","unstructured":"Lefmann, H.: Distributions of points in the unit square and large $$k$$-gons. Eur. J. Combin. 29, 946\u2013965 (2008). https:\/\/doi.org\/10.1016\/j.ejc.2007.11.021","journal-title":"Eur. J. Combin."},{"key":"721_CR12","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. Comb. Theory Ser. A 113, 675\u2013691 (2006). https:\/\/doi.org\/10.1016\/j.jcta.2005.07.002","journal-title":"J. Comb. Theory Ser. A"},{"key":"721_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. Discrete Comput. Geom. 30, 311\u2013320 (2003). https:\/\/doi.org\/10.1007\/s00454-003-0012-9","journal-title":"Discrete Comput. Geom."},{"key":"721_CR14","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/342","volume-title":"Towards a Theory of Geometric Graphs, Contemporary Mathematics","author":"R Pinchasi","year":"2004","unstructured":"Pinchasi, R., Radoi\u010di\u0107, R.: On the number of edges in geometric graphs with no self-intersecting cycle of length 4. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol. 342. American Mathematical Society, Providence (2004). https:\/\/doi.org\/10.1090\/conm\/342"},{"key":"721_CR15","volume-title":"Elements of Homology Theory","author":"VV Prasolov","year":"2007","unstructured":"Prasolov, V.V.: Elements of Homology Theory, vol. 81. American Mathematical Society, Providence (2007)"},{"key":"721_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0001-8708(76)90100-6","volume":"22","author":"KF Roth","year":"1976","unstructured":"Roth, K.F.: Developments in Heilbronn\u2019s triangle problem. Adv. Math. 22, 364\u2013385 (1976). https:\/\/doi.org\/10.1016\/0001-8708(76)90100-6","journal-title":"Adv. Math."},{"key":"721_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","volume":"26","author":"KF Roth","year":"1951","unstructured":"Roth, K.F.: On a problem of Heilbronn. J. Lond. Math. Soc. 26, 198\u2013204 (1951). https:\/\/doi.org\/10.1112\/jlms\/s1-26.3.198","journal-title":"J. Lond. Math. Soc."},{"key":"721_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/plms\/s3-25.2.193","volume":"25","author":"KF Roth","year":"1972","unstructured":"Roth, K.F.: On a problem of Heilbronn II. J. Lond. Math. Soc. 25, 193\u2013212 (1972). https:\/\/doi.org\/10.1112\/plms\/s3-25.2.193","journal-title":"J. Lond. Math. Soc."},{"key":"721_CR19","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1112\/plms\/s3-25.3.543","volume":"25","author":"KF Roth","year":"1972","unstructured":"Roth, K.F.: On a problem of Heilbronn III. J. Lond. Math. Soc. 25, 543\u2013549 (1972). https:\/\/doi.org\/10.1112\/plms\/s3-25.3.543","journal-title":"J. Lond. Math. Soc."},{"key":"721_CR20","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00454-015-9671-4","volume":"53","author":"AJ Ruiz-Vargas","year":"2015","unstructured":"Ruiz-Vargas, A.J.: Empty triangles in complete topological graphs. Discrete Comput. Geom. 53, 703\u2013712 (2015). https:\/\/doi.org\/10.1007\/s00454-015-9671-4","journal-title":"Discrete Comput. Geom."},{"key":"721_CR21","doi-asserted-by":"publisher","unstructured":"Schmidt, W.M.: On a problem of Heilbronn. J. Lond. Math. Soc. 2, 545\u2013550 (1971\/1972). https:\/\/doi.org\/10.1112\/jlms\/s2-4.3.545","DOI":"10.1112\/jlms\/s2-4.3.545"},{"key":"721_CR22","doi-asserted-by":"publisher","unstructured":"Suk, A., Zeng, J.: Unavoidable patterns in complete simple topological graphs. In: Angelini, P., von Hanxleden, R. (eds.) Graph Drawing and Network Visualization GD 2022. Lecture Notes in Computer Science, vol.13764, pp. 3\u201315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_1","DOI":"10.1007\/978-3-031-22203-0_1"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00721-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00721-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00721-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:26:13Z","timestamp":1764361573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00721-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,20]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["721"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00721-w","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2025,2,20]]},"assertion":[{"value":"29 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}