The maximum degree of random planar graphs

McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1logn

Saved in:
Bibliographic Details
Published in:Proceedings of the London Mathematical Society 2014-10, Vol.109 (4), p.892-920
Main Authors: Drmota, M., Giménez, O., Noy, M., Panagiotou, K., Steger, A.
Format: Article
Language:English
Subjects:
Asymptotic properties
Combinatorial analysis
Constants
Formulas (mathematics)
Graph theory
Graphs
Mathematical analysis
Sampling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1logn
ISSN:0024-6115
1460-244X
DOI:10.1112/plms/pdu024