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

Svante Janson; Andrew J. Uzzell

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

Combinatorics 2014-03-13 v1

Authors: Svante Janson , Andrew J. Uzzell

Abstract

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.

Keywords

preferential attachment intersection theory on moduli spaces graph theory

Cite

@article{arxiv.1403.2911,
  title  = {On String Graph Limits and the Structure of a Typical String Graph},
  author = {Svante Janson and Andrew J. Uzzell},
  journal= {arXiv preprint arXiv:1403.2911},
  year   = {2014}
}

Comments

18 pages

Related papers

View all related →