Mathematics – Combinatorics
Scientific paper
2011-01-26
Electronic Journal of Combinatorics 17(1), #R7 (2010)
Mathematics
Combinatorics
20 pages, 11 figures
Scientific paper
Let P_{n,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,m} will contain given
components and subgraphs, finding that there is different asymptotic behaviour
depending on the ratio m/n.
No associations
LandOfFree
The evolution of uniform random planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The evolution of uniform random planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The evolution of uniform random planar graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-419612