AbstractWille found an asymptotic approximation to r(n, q), the number of unlabeled oriented graphs on n points and q directed lines, for a wide interval of q and conjectured that, for given n, the maximum of r(n, q) occurs at q = [2(N + 1)3]. We find the (different) asymptotic approximation to r(n, q) valid for the remaining interval of q and prove Wille's conjecture for all large n
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
We show that the number gn of labelled series-parallel graphs on n vertices is asymptotically gn ∼ g...
AbstractWille found an asymptotic approximation to r(n, q), the number of unlabeled oriented graphs ...
AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l a...
We find the asymptotic number of connected graphs with k vertices and k-1+l edges when k,l approach ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
International audienceIt is shown that the number of labelled graphs with $n$ vertices that can be e...
We obtain asymptotic formulas for the number of rooted 2-connected and 3-connected surface maps on a...
A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and con...
AbstractA long-standing conjecture of Erdős and Simonovits is that ex(n,C2k), the maximum number of ...
An oriented graph is a directed graph with no bi-directed edges, i.e. if xy is an edge then yx is no...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
AbstractCounts of extensions, such as the number of triangles containing a vertex or the number of p...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
We show that the number gn of labelled series-parallel graphs on n vertices is asymptotically gn ∼ g...
AbstractWille found an asymptotic approximation to r(n, q), the number of unlabeled oriented graphs ...
AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l a...
We find the asymptotic number of connected graphs with k vertices and k-1+l edges when k,l approach ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
International audienceIt is shown that the number of labelled graphs with $n$ vertices that can be e...
We obtain asymptotic formulas for the number of rooted 2-connected and 3-connected surface maps on a...
A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and con...
AbstractA long-standing conjecture of Erdős and Simonovits is that ex(n,C2k), the maximum number of ...
An oriented graph is a directed graph with no bi-directed edges, i.e. if xy is an edge then yx is no...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
AbstractCounts of extensions, such as the number of triangles containing a vertex or the number of p...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
We show that the number gn of labelled series-parallel graphs on n vertices is asymptotically gn ∼ g...