Pendant appearances and components in random graphs from structured classes

Abstract

We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of leaves; and obtain results on the asymptotic distribution of components other than the giant component, under quite general conditions.

27 pages, European Journal of Combinatorics