Enumeration and limit laws for series–parallel graphs

We show that the number g n of labelled series–parallel graphs on n vertices is asymptotically g n ∼ g ⋅ n − 5 / 2 γ n n ! , where γ and g are explicit computable constants. We show that the number of edges in random series–parallel graphs is asymptotically normal with linear mean and variance, and that it is sharply concentrated around its expected value. Similar results are proved for labelled outerplanar graphs and for graphs not containing K 2 , 3 as a minor.