On String Graph Limits and the Structure of a Typical String Graph
classification
🧮 math.CO
keywords
stringgraphgraphslimitsresultsbehaviorclassesconsisting
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.