This book explains similarities in asymptotic behavior as the result of two basic properties
shared by the structures: the conditioning relation and the logarithmic condition. The …

We show that the number of labeled cubic planar graphs on n vertices with n even is
asymptotically αn− 7/2ρ− nn!, where ρ− 1≐ 3.13259 and α are analytic constants. We show …

A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see
that such a class of labelled graphs has smooth growth; and, for the random graph Rn …

We study Gibbs partitions that typically form a unique giant component. The remainder is
shown to converge in total variation toward a Boltzmann‐distributed limit structure. We …

This paper studies the distribution of the component spectrum of combinatorial structures
such as uniform random forests, in which the classical generating function for the numbers of …

We study random composite structures considered up to symmetry that are sampled
according to weights on the inner and outer structures. This model may be viewed as an …

Let. We classify our examples accordingly, thus taking a first step towards a classification of
minor-closed classes of graphs. Furthermore, we investigate a parameter that has not …

Compton's method of proving monadic second-order limit laws is based on analyzing the
generating function of a class of finite structures. For applications of his deeper results we …

We study the structure of the asymptotic expansion of the probability that a combinatorial
object is connected. We show that the coefficients appearing in those asymptotics are …

Asymptotics of combinatorial structures with large smallest component Page 1 Journal of
Combinatorial Theory, Series A 107 (2004) 117–125 Asymptotics of combinatorial structures …