Name
Abstract | ||
|---|---|---|
Let P n,d,D denote the graph taken uniformly at random from the set of all labelled planar graphs on {1, 2, . . . , n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability that P n,d,D will contain given components and subgraphs, showing exactly when this is bounded away from 0 and 1 as n → ∞. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00373-010-0960-7 | Graphs and Combinatorics |
Keywords | Field | DocType |
minimum degrees,maximum degree,random planar graphs,labelled planar graph,p n,planar graphsrandom graphsbounded degreeslabelled graphs,d denote,minimum degree,planar graph | Topology,Discrete mathematics,Random regular graph,Combinatorics,Indifference graph,Random graph,Chordal graph,Degree (graph theory),Book embedding,1-planar graph,Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
27 | 1 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chris Dowden | 1 | 5 | 4.26 |