Random planar maps and graphs with minimum degree two and three

MaRDI QIDQ5419974zbMATH OpenFDO

Authors Marc Noy, Lander Ramos

Publication date 11 June 2014

Full work available at URL https://arxiv.org/abs/1403.5211

zbMATH Keywords

core of a graphkernel of a graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

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.

Cited in

(2)

• Multi-point functions of weighted cubic maps
• 3-Connected Cores In Random Planar Graphs

This page was built for publication: Random planar maps and graphs with minimum degree two and three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419974)