Random planar maps and graphs with minimum degree two and three (Q1991412)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random planar maps and graphs with minimum degree two and three |
scientific article; zbMATH DE number 6968252
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random planar maps and graphs with minimum degree two and three |
scientific article; zbMATH DE number 6968252 |
Statements
Random planar maps and graphs with minimum degree two and three (English)
0 references
30 October 2018
0 references
Summary: We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to the core of a random planar graph is of order \(c \log(n)\) for an explicit constant \(c\). These results provide new information on the structure of random planar graphs.
0 references
asymptotic enumeration
0 references
planar graphs
0 references
random graphs
0 references
0 references
