# Almost all string graphs are intersection graphs of plane convex sets

@inproceedings{Pach2018AlmostAS,
title={Almost all string graphs are intersection graphs of plane convex sets},
author={J. Pach and B. Reed and Y. Yuditsky},
booktitle={SoCG},
year={2018}
}
• Published in SoCG 2018
• Computer Science, Mathematics
A {\em 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 {\em almost all} string graphs on $n$ vertices can be partitioned into {\em five} cliques such that some pair of them is not connected by any edge ($n\rightarrow\infty$). We also show… Expand
4 Citations

#### Figures and Topics from this paper

Ordered graphs and large bi-cliques in intersection graphs of curves
• Mathematics, Computer Science
• Eur. J. Comb.
• 2019

#### References

SHOWING 1-10 OF 37 REFERENCES
Recognizing string graphs in NP
• Computer Science, Mathematics
• STOC '02
• 2002
On intersection representations of co-planar graphs
• Computer Science, Mathematics
• Discret. Math.
• 1998
Decidability of string graphs
• Computer Science, Mathematics
• STOC '01
• 2001
How Many Ways Can One Draw a Graph?
• Mathematics, Computer Science
• Graph Drawing
• 2003
How Many Ways Can One Draw A Graph?
• Mathematics, Computer Science
• Comb.
• 2006
The fine structure of octahedron-free graphs
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2011
Hereditary and Monotone Properties of Graphs
• Physics, Computer Science
• The Mathematics of Paul Erdős II
• 2013
Almost all Berge Graphs are Perfect
• Mathematics, Computer Science
• Comb. Probab. Comput.
• 1992