Name
Abstract | ||
|---|---|---|
Let P-n,P-m denote the graph taken uniformly at random from the set of all planar graphs on {1,2,...,n} with exactly m(n) edges. We use counting arguments to investigate the probability that P-n,P-m will contain given components and subgraphs, finding that there is different asymptotic behaviour depending on the ratio m/n. |
Year | Venue | Keywords |
|---|---|---|
2010 | ELECTRONIC JOURNAL OF COMBINATORICS | planar graph |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Power sum symmetric polynomial,Orthogonal polynomials,Classical orthogonal polynomials,Elementary symmetric polynomial,Ring of symmetric functions,Discrete orthogonal polynomials,Complete homogeneous symmetric polynomial,Mathematics,Difference polynomials | Journal | 17 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 2 |
PageRank | References | Authors |
0.45 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chris Dowden | 1 | 5 | 4.26 |