---
res:
bibo_abstract:
- '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.@eng'
bibo_authorlist:
- foaf_Person:
foaf_givenName: János
foaf_name: Pach, János
foaf_surname: Pach
foaf_workInfoHomepage: http://www.librecat.org/personId=E62E3130-B088-11EA-B919-BF823C25FEA4
- foaf_Person:
foaf_givenName: Bruce
foaf_name: Reed, Bruce
foaf_surname: Reed
- foaf_Person:
foaf_givenName: Yelena
foaf_name: Yuditsky, Yelena
foaf_surname: Yuditsky
bibo_doi: 10.1007/s00454-020-00213-z
bibo_issue: '4'
bibo_volume: 63
dct_date: 2020^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/01795376
- http://id.crossref.org/issn/14320444
dct_language: eng
dct_publisher: Springer Nature@
dct_title: Almost all string graphs are intersection graphs of plane convex sets@
...