Enumeration and limit laws of series-parallel graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages

Scientific paper

We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g\cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants. We show that the number of edges in random series-parallel graphs is asymptotically normal with linear mean and variance, and that the number of edges is sharply concentrated around its expected value. Similar results are proved for labelled outerplanar graphs and for graphs not containing $K_{2,3}$ as a minor.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Enumeration and limit laws of series-parallel 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 Enumeration and limit laws of series-parallel graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration and limit laws of series-parallel graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-281495

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.