Asymptotic Enumeration of Graph Classes with Many Components.

We consider graph classes $mathcal G$ in which every graph has components in a class $mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $lvertmathcal{G}_{n,N}rvert$, the number of graphs in $mathcal{G}$ with $n$ vertices and $N:=lfloorlambda nrfloor$ components, where $lambdain(0,1)$. Assuming that the number of graphs with $n$ vertices in $mathcal{C}$ satisfies begin{align*} lvert mathcal{C}_nrvertsim b n^{-(1+alpha)}rho^{-n}n!, quad nto infty end{align*} for some $b,rhou003e0$ and $alphau003e1$ -- a property commonly encountered in graph enumeration -- we show that begin{align*} lvertmathcal{G}_{n,N}rvertsim c(lambda) n^{f(lambda)} (log n)^{g(lambda)} rho^{-n}h(lambda)^{N}frac{n!}{N!}, quad nto infty end{align*} for explicitly given $c(lambda),f(lambda),g(lambda)$ and $h(lambda)$. These functions are piecewise continuous with a discontinuity at a critical value $lambda^{*}$, which we also determine. The central idea in our approach is to sample objects of $cal G$ randomly by so-called Boltzmann generators in order to translate enumerative problems to the analysis of iid random variables. By that we are able to exploit local limit theorems and large deviation results well-known from probability theory to prove our claims. The main results are formulated for generic combinatorial classes satisfying the SET-construction.