{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:30:11Z","timestamp":1767018611441,"version":"3.48.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"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"],"award-info":[{"award-number":["DMS-1800746"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1952786"],"award-info":[{"award-number":["DMS-1952786"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2246847"],"award-info":[{"award-number":["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":[[2026,1]]},"DOI":"10.1007\/s00454-024-00692-4","type":"journal-article","created":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T16:06:52Z","timestamp":1732118812000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Short Edges in Complete Topological Graphs"],"prefix":"10.1007","volume":"75","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"692_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 EuroCG \u201915, pp. 57\u201360, Ljubljana, Slovenia (2015)","DOI":"10.1007\/s00373-015-1550-5"},{"key":"692_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\u00a038th Symposium on Computational Geometry, LIPIcs, Dagstuhl, Germany, pp. 5:1\u20135:18 (2022)"},{"key":"692_CR3","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-Verlag, Berlin (2005)"},{"key":"692_CR4","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4, 467\u2013489 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"692_CR5","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00493-021-4530-9","volume":"41","author":"J Fox","year":"2021","unstructured":"Fox, J., Pach, J., Suk, A.: Bounded VC-dimension implies the Schur-Erdos conjecture. Combinatorica 41, 803\u2013813 (2021)","journal-title":"Combinatorica"},{"key":"692_CR6","doi-asserted-by":"crossref","unstructured":"Fulek, R., Ruiz-Vargas, A.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of the 29th Annual Symposium on Computational Geometry (SoCG\u201913), pp. 259\u2013266 (2013)","DOI":"10.1145\/2493132.2462394"},{"key":"692_CR7","first-page":"83","volume":"102","author":"H Harborth","year":"1994","unstructured":"Harborth, H., Th\u00fcrmann, C.: Minimum number of edges with at most $$s$$ crossings in drawings of the complete graph. Congr. Numer. 102, 83\u201390 (1994)","journal-title":"Congr. Numer."},{"key":"692_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0097-3165(95)90052-7","volume":"69","author":"D Haussler","year":"1995","unstructured":"Haussler, D.: Sphere packing numbers for subsets of the Boolean $$n$$-cube with bounded Vapnik-Chervonenkis dimension. J. Comb. Theory Ser. A 69, 217\u2013232 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"key":"692_CR9","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. Discret. Math. 309, 1917\u20131923 (2009)","journal-title":"Discret. Math."},{"key":"692_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy: An Illustrated Guide. Volume 18 of Algorithms and Combinatorics","author":"J Matousek","year":"1999","unstructured":"Matousek, J.: Geometric Discrepancy: An Illustrated Guide. Volume 18 of Algorithms and Combinatorics. Springer, Berlin (1999)"},{"key":"692_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-30540-8_15","volume-title":"Combinatorial Geometry and Graph Theory, Lecture Notes in Computer Science","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, Lecture Notes in Computer Science, vol. 3330, pp. 133\u2013140. Springer-Verlag, Berlin (2005)"},{"key":"692_CR12","unstructured":"Rafla, N.H.: The good drawings $$D_n$$ of the complete graph $$K_n$$. PhD Thesis, McGill University, Montreal (1988)"},{"key":"692_CR13","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":"692_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"12","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theory Ser. A 12, 145\u2013147 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"key":"692_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem, stability and order for models and theories in infinitary languages. Pac. J. Math. 41, 247\u2013261 (1972)","journal-title":"Pac. J. Math."},{"key":"692_CR16","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":"692_CR17","doi-asserted-by":"crossref","unstructured":"Suk, A., Zeng, J.: Unavoidable patterns in complete simple topological graphs. Graph Drawing and Network Visualization, GD (2022)","DOI":"10.52843\/cassyni.gfmg6m"},{"key":"692_CR18","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00692-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-024-00692-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00692-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:26:46Z","timestamp":1767018406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-024-00692-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["692"],"URL":"https:\/\/doi.org\/10.1007\/s00454-024-00692-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"2 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}