On String Graph Limits and the Structure of a Typical String Graph

We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes.

Saved in:
Bibliographic Details
Published in:Journal of graph theory Vol. 84; no. 4; pp. 386 - 407
Main Authors: Janson, Svante, Uzzell, Andrew J.
Format: Journal Article
Language:English
Published: Hoboken Wiley Subscription Services, Inc 01.04.2017
Subjects:
ISSN:0364-9024, 1097-0118, 1097-0118
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes.
Bibliography:Contract grant sponsor: Knut and Alice Wallenberg Foundation.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-9024
1097-0118
1097-0118
DOI:10.1002/jgt.22031