Random planar maps and graphs with minimum degree two and three
Combinatorics
2018-06-12 v2 Probability
Abstract
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.
Keywords
Cite
@article{arxiv.1403.5211,
title = {Random planar maps and graphs with minimum degree two and three},
author = {Marc Noy and Lander Ramos},
journal= {arXiv preprint arXiv:1403.5211},
year = {2018}
}
Comments
32 pages