{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:08:01Z","timestamp":1752282481884,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"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-1800746"],"award-info":[{"award-number":["DMS-1800746","DMS-1952786","DMS-1800746"]}],"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,1]]},"DOI":"10.1007\/s00454-024-00658-6","type":"journal-article","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T19:01:43Z","timestamp":1717009303000},"page":"79-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unavoidable Patterns in Complete Simple Topological Graphs"],"prefix":"10.1007","volume":"73","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[]},{"given":"Ji","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"658_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G., Vogtenhuber, B.: All good drawings of small complete graphs. In: Proceedings of the 31st European Workshop on Computational Geometry, pp. 57\u201360 (2015)","DOI":"10.1007\/s00373-015-1550-5"},{"key":"658_CR2","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: Proceedings of the 38th Symposium on Computational Geometry, pp. 5:1\u20135:18, LIPIcs, Dagstuhl, Germany (2022)"},{"key":"658_CR3","volume-title":"The Probabilistic Method","author":"N Alon","year":"2016","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 4th edn. John Wiley & Sons Inc., Hoboken (2016)","edition":"4"},{"key":"658_CR4","volume-title":"Research Problems in Discrete Geometry","author":"P Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)"},{"key":"658_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"658_CR6","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"658_CR7","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1112\/plms\/pds018","volume":"105","author":"J Fox","year":"2012","unstructured":"Fox, J., Pach, J., Sudakov, B., Suk, A.: Erd\u0151s-Szekeres-type theorems for monotone paths and convex bodies. Proc. Lond. Math. Soc. 105, 953\u2013982 (2012)","journal-title":"Proc. Lond. Math. Soc."},{"key":"658_CR8","doi-asserted-by":"crossref","unstructured":"Fulek, R., Ruiz-Vargas, A.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of the 29th Symposium on Computational Geometry, pp. 259\u2013265, ACM Press, New York (2013)","DOI":"10.1145\/2493132.2462394"},{"key":"658_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Am. Math. Mon. 98, 165\u2013166 (1991)","journal-title":"Am. Math. Mon."},{"key":"658_CR10","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":"658_CR11","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-013-9535-8","volume":"50","author":"J Kyn\u010dl","year":"2013","unstructured":"Kyn\u010dl, J.: Improved enumeration of simple topological graphs. Discrete Comput. Geom. 50, 727\u2013770 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"658_CR12","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1016\/j.disc.2008.03.005","volume":"309","author":"J Kyn\u010dl","year":"2009","unstructured":"Kyn\u010dl, J., Valtr, P.: On edges crossing few other edges in simple topological complete graphs. Discrete Math. 309, 1917\u20131923 (2009)","journal-title":"Discrete Math."},{"key":"658_CR13","unstructured":"Pach, J.: Geometric graph theory. In: Goodman, J., O\u2019Rourke, J., T\u00f3th, C. (eds) Handbook of Discrete and Computational Geometry, 3rd edn, pp. 257\u2013279. CRC Press, Boca Raton, Florida (2017)"},{"key":"658_CR14","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)","journal-title":"Discrete Comput. Geom."},{"key":"658_CR15","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. In: Graph Drawing 2000. Lecture Notes in Computer Science 1984, vol. 2001, pp. 328\u2013337. Springer","DOI":"10.1007\/3-540-44541-2_31"},{"key":"658_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-30540-8_15","volume-title":"Combinatorial Geometry and Graph Theory","author":"J Pach","year":"2005","unstructured":"Pach, J., T\u00f3th, G.: Disjoint edges in topological graphs. In: Akiyama, J., et al. (eds.) Combinatorial Geometry and Graph Theory, pp. 133\u2013140. Springer, Berlin (2005)"},{"key":"658_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2016.11.003","volume":"62","author":"A Ruiz-Vargas","year":"2017","unstructured":"Ruiz-Vargas, A.: Many disjoint edges in topological graphs. Comput. Geom. 62, 1\u201313 (2017)","journal-title":"Comput. Geom."},{"key":"658_CR18","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.ejc.2015.07.004","volume":"51","author":"A Ruiz-Vargas","year":"2016","unstructured":"Ruiz-Vargas, A., Suk, A., T\u00f3th, C.: Disjoint edges in topological graphs and the tangled-thrackle conjecture. Eur. J. Comb. 51, 398\u2013406 (2016)","journal-title":"Eur. J. Comb."},{"key":"658_CR19","unstructured":"Scheucher, M.: personal communication"},{"key":"658_CR20","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00454-012-9481-x","volume":"49","author":"A Suk","year":"2013","unstructured":"Suk, A.: Disjoint edges in complete topological graphs. Discrete Comput. Geom. 49, 280\u2013286 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"658_CR21","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1090\/jams\/869","volume":"30","author":"A Suk","year":"2017","unstructured":"Suk, A.: On the Erdos-Szekeres convex polygon problem. J. Am. Math. Soc. 30, 1047\u20131053 (2017)","journal-title":"J. Am. Math. Soc."},{"key":"658_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2015.06.001","volume":"50","author":"A Suk","year":"2015","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in $$k$$-quasi-planar graphs. Comput. Geom. 50, 24\u201333 (2015)","journal-title":"Comput. Geom."},{"key":"658_CR23","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1006\/jcta.1999.3001","volume":"89","author":"G T\u00f3th","year":"2000","unstructured":"T\u00f3th, G.: Note on geometric graphs. J. Comb. Theory Ser. A 89, 126\u2013132 (2000)","journal-title":"J. Comb. Theory Ser. A"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00658-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-024-00658-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00658-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T16:05:01Z","timestamp":1736179501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-024-00658-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["658"],"URL":"https:\/\/doi.org\/10.1007\/s00454-024-00658-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2024,5,29]]},"assertion":[{"value":"11 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}