AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l approach infinity, re-proving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k,p) for an appropriate edge probability p. Central is the analysis of a random walk with fixed beginning and end which is tilted to the left
AbstractThe theme of this work is an “inside-out” approach to the enumeration of graphs. It is based...
A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an...
A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and con...
We find the asymptotic number of connected graphs with k vertices and k-1+l edges when k,l approach ...
AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l a...
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on ...
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on ...
AbstractWe introduce the notion of the asymptotic connectivity of a graph by generalizing to infinit...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
Abstract Let Wk denote the number of walks of length k ( ≥ 0) in a finite graph G, and define ∆k = ∆...
AbstractWille found an asymptotic approximation to r(n, q), the number of unlabeled oriented graphs ...
Abstract. Let C(n, k) denote the number of connected graphs with n labeled vertices and n+ k − 1 edg...
This paper provides an overview of results, concerning longest or heaviest paths, in the area of ran...
AbstractCounts of extensions, such as the number of triangles containing a vertex or the number of p...
AbstractThe theme of this work is an “inside-out” approach to the enumeration of graphs. It is based...
A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an...
A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and con...
We find the asymptotic number of connected graphs with k vertices and k-1+l edges when k,l approach ...
AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l a...
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on ...
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on ...
AbstractWe introduce the notion of the asymptotic connectivity of a graph by generalizing to infinit...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
Abstract Let Wk denote the number of walks of length k ( ≥ 0) in a finite graph G, and define ∆k = ∆...
AbstractWille found an asymptotic approximation to r(n, q), the number of unlabeled oriented graphs ...
Abstract. Let C(n, k) denote the number of connected graphs with n labeled vertices and n+ k − 1 edg...
This paper provides an overview of results, concerning longest or heaviest paths, in the area of ran...
AbstractCounts of extensions, such as the number of triangles containing a vertex or the number of p...
AbstractThe theme of this work is an “inside-out” approach to the enumeration of graphs. It is based...
A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an...
A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and con...
DOI
Add to ORKG