Back to Search
Start Over
THE SIZE OF THE LARGEST COMPONENTS IN RANDOM PLANAR MAPS.
- Source :
-
SIAM Journal on Discrete Mathematics . 1999, Vol. 12 Issue 2, p217-228. 12p. - Publication Year :
- 1999
-
Abstract
- Bender, Richmond, and Wormald showed that in almost all planar 3-connected triangulations (or dually, 3-connected cubic maps) with n edges, the largest 4-connected triangulation (or dually, the largest cyclically 4-edge-connected cubic component) has about n/2 edges [Random Structures Algorithms, 7 (1995), pp. 273-285]. In this paper, we derive some general results about the size of the largest component and apply them to a variety of types of planar maps. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 12
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 13220235
- Full Text :
- https://doi.org/10.1137/S0895480195292053