Loading...
Loading...

Go to the content (press return)

Random planar maps and graphs with minimum degree two and three

Author
Noy, M.; Ramos, L.
Type of activity
Journal article
Journal
Electronic journal of combinatorics
Date of publication
2018-10-05
Volume
25
Number
4
First page
1
Last page
38
Project funding
Barcelona Graduate School of Mathematics
Discrete, geometric and random structures
Repository
http://hdl.handle.net/2117/130669 Open in new window
URL
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p5/pdf Open in new window
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.
Citation
Noy, M.; Ramos, L. Random planar maps and graphs with minimum degree two and three. "Electronic journal of combinatorics", 5 Octubre 2018, vol. 25, núm. 4, p. 1-38.
Keywords
Combinatorics, Graph theory
Group of research
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

Attachments