Asymptotic enumeration of strongly connected digraphs by vertices and edges

Details Asymptotic enumeration of strongly connected digraphs by vertices and edges Asymptotic enumeration of strongly connected digraphs by vertices and edges

2010-05-07

arxiv.org/abs/1005.1285v3

Mathematics

Combinatorics

35 pages

Scientific paper

We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results which apply to $m=n+O(1)$, and the long-known threshold for $m$, above which a random digraph with $n$ vertices and $m$ arcs is likely to be strongly connected.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223464