88 search results - page 1 / 18 » Counting connected graphs asymptotically |
ENDM
2007
13 years 10 months ago
2007
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
EJC
2006
13 years 11 months ago
2006
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 pro...
JCT
2007
13 years 10 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
DM
2010
13 years 11 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
APPROX
2004
Springer
14 years 4 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...