{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:17:21Z","timestamp":1764364641393,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_1","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Unavoidable Patterns in\u00a0Complete Simple Topological Graphs"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"1_CR1","unstructured":"\u00c1brego, B., et al.: All good drawings of small complete graphs. In: Proceedings 31st European Workshop on Computational Geometry, pp. 57\u201360 (2015)"},{"key":"1_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 38th Symposium Computational Geometry, LIPIcs, Dagstuhl, Germany, pp. 1\u201318 (2022)"},{"key":"1_CR3","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 4th edn. John Wiley & Sons Inc., Hoboken, New Jersey (2016)"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer-Verlag, Berlin, Germany (2005). https:\/\/doi.org\/10.1007\/0-387-29929-7","DOI":"10.1007\/0-387-29929-7"},{"key":"1_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. of Math. 51, 161\u2013166 (1950)","journal-title":"Ann. of Math."},{"key":"1_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":"1_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":"1_CR8","doi-asserted-by":"crossref","unstructured":"Fulek, R., Ruiz-Vargas, A.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings 29th Symposium Computational Geometry, pp. 259\u2013265. ACM Press, New York (2013)","DOI":"10.1145\/2462356.2462394"},{"key":"1_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":"1_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":"1_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 eumeration of simple topological graphs. Disc. Comput. Geom. 50, 727\u2013770 (2013)","journal-title":"Disc. Comput. Geom."},{"key":"1_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. Discret. Math. 309, 1917\u20131923 (2009)","journal-title":"Discret. Math."},{"key":"1_CR13","unstructured":"Pach, J.: Geometric graph theory. In: Goodman, J., O\u2019Rourke, J., T\u00f3th, C. (eds.) Handbook of Discrete and Computational Geometry, 3rd edition, CRC Press, Boca Raton, Florida, pp. 257\u2013279 (2017)"},{"key":"1_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. Disc. Comput. Geom. 30, 311\u2013320 (2003)","journal-title":"Disc. Comput. Geom."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","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., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol. 3330, pp. 133\u2013140. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30540-8_15"},{"key":"1_CR16","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":"1_CR17","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. European J. Combin. 51, 398\u2013406 (2016)","journal-title":"European J. Combin."},{"key":"1_CR18","unstructured":"Scheucher, M.: Personal communication"},{"key":"1_CR19","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. Disc. Comput. Geom. 49, 280\u2013286 (2013)","journal-title":"Disc. Comput. Geom."},{"key":"1_CR20","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. Amer. Math. Soc. 30, 1047\u20131053 (2017)","journal-title":"J. Amer. Math. Soc."},{"key":"1_CR21","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":"1_CR22","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. Combin. Theory Ser. A 89, 126\u2013132 (2000)","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:03:37Z","timestamp":1704351817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.01","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.03","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}