Name
Abstract | ||
|---|---|---|
Let P(n,m) be a graph chosen uniformly at random from the class of all planar graphs on vertex set {1, horizontal ellipsis ,n} with m=m(n) edges. We study the cycle and block structure of P(n,m) when m similar to n/2. More precisely, we determine the asymptotic order of the length of the longest and shortest cycle in P(n,m) in the critical range when m=n/2+o(n). In addition, we describe the block structure of P(n,m) in the weakly supercritical regime when n2/3MUCH LESS-THANm-n/2MUCH LESS-THANn. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1002/rsa.21040 | RANDOM STRUCTURES & ALGORITHMS |
Keywords | DocType | Volume |
blocks, cycles, planar graphs, Polya urn, random graphs | Journal | 60 |
Issue | ISSN | Citations |
3 | 1042-9832 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihyun Kang | 1 | 163 | 29.18 |
| Michael Missethan | 2 | 0 | 0.34 |