Pendant appearances and components in random graphs from structured classes
Colin McDiarmid · European Journal of Combinatorics · 2024
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 earlier results on pendant appearances, concerning for example numbers of leaves, and we find the asymptotic distribution of components other than the giant component, under quite general conditions.