On the number of series parallel and outerplanar graphs
We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants. We show that the number of edges in random series-parallel graphs is asymptotically normal with linear...
Main Authors: | Manuel Bodirsky, Omer Gimenez, Mihyun Kang, Marc Noy |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3451/pdf |
Similar Items
-
Indecomposable permutations with a given number of cycles
by: Robert Cori, et al.
Published: (2009-01-01) -
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Colouring random geometric graphs
by: Colin J. H. McDiarmid, et al.
Published: (2005-01-01) -
Equivalent Subgraphs of Order $3$
by: Tomoki Nakamigawa
Published: (2005-01-01)