{"author":[{"first_name":"János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"},{"last_name":"Reed","first_name":"Bruce","full_name":"Reed, Bruce"},{"full_name":"Yuditsky, Yelena","last_name":"Yuditsky","first_name":"Yelena"}],"issue":"4","external_id":{"arxiv":["1803.06710"]},"date_updated":"2021-01-12T08:16:15Z","citation":{"apa":"Pach, J., Reed, B., & Yuditsky, Y. (2020). Almost all string graphs are intersection graphs of plane convex sets. *Discrete and Computational Geometry*. Springer Nature. https://doi.org/10.1007/s00454-020-00213-z","mla":"Pach, János, et al. “Almost All String Graphs Are Intersection Graphs of Plane Convex Sets.” *Discrete and Computational Geometry*, vol. 63, no. 4, Springer Nature, 2020, pp. 888–917, doi:10.1007/s00454-020-00213-z.","ista":"Pach J, Reed B, Yuditsky Y. 2020. Almost all string graphs are intersection graphs of plane convex sets. Discrete and Computational Geometry. 63(4), 888–917.","chicago":"Pach, János, Bruce Reed, and Yelena Yuditsky. “Almost All String Graphs Are Intersection Graphs of Plane Convex Sets.” *Discrete and Computational Geometry*. Springer Nature, 2020. https://doi.org/10.1007/s00454-020-00213-z.","short":"J. Pach, B. Reed, Y. Yuditsky, Discrete and Computational Geometry 63 (2020) 888–917.","ieee":"J. Pach, B. Reed, and Y. Yuditsky, “Almost all string graphs are intersection graphs of plane convex sets,” *Discrete and Computational Geometry*, vol. 63, no. 4. Springer Nature, pp. 888–917, 2020.","ama":"Pach J, Reed B, Yuditsky Y. Almost all string graphs are intersection graphs of plane convex sets. *Discrete and Computational Geometry*. 2020;63(4):888-917. doi:10.1007/s00454-020-00213-z"},"scopus_import":1,"department":[{"_id":"HeEd"}],"publication_status":"published","title":"Almost all string graphs are intersection graphs of plane convex sets","_id":"7962","intvolume":" 63","date_created":"2020-06-14T22:00:51Z","publication":"Discrete and Computational Geometry","language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_type":"original","day":"05","abstract":[{"lang":"eng","text":"A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that some pair of them is not connected by any edge (n→∞). We also show that every graph with the above property is an intersection graph of plane convex sets. As a corollary, we obtain that almost all string graphs on n vertices are intersection graphs of plane convex sets."}],"oa_version":"Preprint","date_published":"2020-06-05T00:00:00Z","article_processing_charge":"No","project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"year":"2020","volume":63,"doi":"10.1007/s00454-020-00213-z","publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"month":"06","publisher":"Springer Nature","page":"888-917","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.06710"}]}