Journal article
On the Maximum Degree of a Random Planar Graph.
- Abstract:
- Let the random graph Rn be drawn uniformly at random from the set of all simple planar graphs on n labelled vertices. We see that with high probability the maximum degree of Rn is ⊖(ln n). We consider also the maximum size of a face and the maximum increase in the number of components on deleting a vertex. These results extend to graphs embeddable on any fixed surface. © 2008 Cambridge University Press.
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Journal:
- Combinatorics, Probability and Computing
- Volume:
- 17
- Issue:
- 4
- Pages:
- 591-601
- Publication date:
- 2008-01-01
- DOI:
- EISSN:
-
1469-2163
- ISSN:
-
0963-5483
- Source identifiers:
-
102285
Item Description
- Language:
- English
- Pubs id:
-
pubs:102285
- UUID:
-
uuid:5f097513-a439-4815-bdb5-e147feeb7b02
- Local pid:
- pubs:102285
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2008
If you are the owner of this record, you can report an update to it here: Report update to this record