Asymptotic enumeration of sparse 2-connected graphs

Details Asymptotic enumeration of sparse 2-connected graphs Asymptotic enumeration of sparse 2-connected graphs

2010-10-12

arxiv.org/abs/1010.2516v2

Mathematics

Combinatorics

Scientific paper

We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to\infty$ and $m=O(n\log n)$ as $n\to\infty$. This is the entire range of $m$ not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2. The case of 2-edge-connectedness is treated similarly. We also obtain formulae for the number of 2-connected graphs with given degree sequence for most (`typical') sequences. Our main result solves a problem of Wright from 1983.

Affiliated with

Also associated with

No associations

Rating

Asymptotic enumeration of sparse 2-connected 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 Asymptotic enumeration of sparse 2-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic enumeration of sparse 2-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225912