Counting strongly-connected, moderately sparse directed graphs

A sharp asymptotic formula for the number of strongly connected digraphs on n labelled vertices with m arcs, under the condition m - n ≫ n2/3, m = O(n), is obtained; this provides a partial solution of a problem posed by Wright back in 1977. This formula is a counterpart of a classic asymptotic formula, due to Bender, Canfield and McKay, for the total number of connected undirected graphs on n vertices with m edges. A key ingredient of their proof was a recurrence equation for the connected graphs count due to Wright. No analogue of Wright's recurrence seems to exist for digraphs. In a previous paper with Nick Wormald we rederived the BCM formula by counting first connected graphs among the graphs of minimum degree 2, at least. In this paper, using a similar embedding for directed graphs, we find an asymptotic formula, which includes an explicit error term, for the fraction of strongly-connected digraphs with parameters m and n among all such digraphs with positive in/out-degrees. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013

[1]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[2]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[3]  Nicholas C. Wormald,et al.  Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172] , 2008, J. Comb. Theory, Ser. B.

[4]  Tomasz Łuczak,et al.  On the number of sparse connected graphs , 1990 .

[5]  Vlady Ravelomanana,et al.  Random 2-XORSAT at the Satisfiability Threshold , 2008, LATIN.

[6]  B. Pittel,et al.  Maximum matchings in sparse random graphs: Karp-Sipser revisited , 1998 .

[7]  E. M. Wright.  FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS , 1977 .

[8]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[9]  Taral Guldahl Seierstad,et al.  The critical behavior of random digraphs , 2009 .

[10]  Brendan D. McKay,et al.  The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges , 1990, Random Struct. Algorithms.

[11]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[12]  Nicholas C. Wormald,et al.  Counting connected graphs inside-out , 2005, J. Comb. Theory, Ser. B.

[13]  Edward M. Wright,et al.  The number of connected sparsely edged graphs , 1977, J. Graph Theory.

[14]  B. Bollobás.  The evolution of random graphs , 1984 .

[15]  Nicholas C. Wormald,et al.  Asymptotic enumeration of sparse graphs with a minimum degree constraint , 2003, J. Comb. Theory A.

[16]  V. E. Stepanov.  On Some Features of the Structure of a Random Graph Near a Critical Point , 1988 .

[17]  B. Pittel,et al.  The structure of a random graph at the point of the phase transition , 1994 .

[18]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[19]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[20]  Joel H. Spencer,et al.  Counting connected graphs asymptotically , 2006, Eur. J. Comb..

[21]  Tomasz Łuczak.  Component behavior near the critical point of the random graph process , 1990 .

[22]  Edward M. Wright,et al.  The number of connected sparsely edged graphs. III. Asymptotic results , 1980, J. Graph Theory.