Counting Connected Graphs Asymptotically

Details Counting Connected Graphs Asymptotically Counting Connected Graphs Asymptotically

2005-02-28

arxiv.org/abs/math/0502579v1

Mathematics

Combinatorics

23 pages

Scientific paper

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on the random graph $G(k,p)$ for an appropriate edge probability $p$. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.

Affiliated with

Also associated with

No associations

Rating

Counting Connected Graphs Asymptotically 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 Counting Connected Graphs Asymptotically, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Connected Graphs Asymptotically will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-142585