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}
}
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

Figures and Topics from this paper

Intersection Graphs of Maximal Sub-polygons of $k$-Lizards
We introduce k-maximal sub-polygon graphs (k-MSP graphs), the intersection graphs of maximal polygons contained in a polygon with sides parallel to a regular 2k-gon. We prove that all complete graphsExpand
Ordered graphs and large bi-cliques in intersection graphs of curves
TLDR
It is proved that for every positive integer $k$, there exists a constant $c>0$ such that every ordered graph on $n$ vertices that does not contain a monotone path of length $k$ as an induced subgraph has a vertex of degree at least $c_kn, or its complement has a bi-clique of size at least c_kn/\log n. Expand
A Sharp Threshold Phenomenon in String Graphs
We prove that for every $\epsilon>0$ there exists $\delta>0$ such that the following holds. Let $\mathcal{C}$ be a collection of $n$ curves in the plane such that there are at mostExpand
A ug 2 01 9 A sharp threshold phenomenon in string graphs
We prove that for every ǫ > 0 there exists δ > 0 such that the following holds. Let C be a collection of n curves in the plane such that there are at most ( 4 − ǫ)n2 2 pairs of curves {α, β} in CExpand

References

SHOWING 1-10 OF 37 REFERENCES
Recognizing string graphs in NP
TLDR
It is shown that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the Recognition problem is NP-hard. Expand
On intersection representations of co-planar graphs
Abstract We show that complements of planar graphs have intersection representations by convex sets in the plane, i.e., for every planar graph, one can assign convex sets in the plane to its verticesExpand
Decidability of string graphs
We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a drawing realizing the string graph in theExpand
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
TLDR
Lethr(n) denote the maximum number of edges in anr-uniform hypergraph onn vertices and in which the union of any three edges has size greater than 3r − 3. Expand
How Many Ways Can One Draw a Graph?
Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuousExpand
How Many Ways Can One Draw A Graph?
Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuousExpand
The fine structure of octahedron-free graphs
TLDR
Sharp results are proved about the case L={O"6}, where O"6 is the graph with 6 vertices and 12 edges, given by the edges of an octahedron, which are natural extensions of theorems of classical extremal graph theory. Expand
Hereditary and Monotone Properties of Graphs
TLDR
It is shown that the limit lim n → ∞ c n always exists and equals 1 − 1 ∕ r, where r is a positive integer which can be described explicitly in terms of \(\mathcal{P}\). Expand
Almost all Berge Graphs are Perfect
TLDR
This paper proves that the strong perfect graph conjecture is at least asymptotically true, i.e. the set of all perfect graphs on n vertices is defined to be Berge(n) for all n. Expand
Excluding Induced Subgraphs III: A General Asymptotic
In this article we study asymptotic properties of the class of graphs not containing a fixed graph H as an induced subgraph. In particular we show that the number Forbn★(H) of such graphs on nExpand
...
1
2
3
4
...