Asymptotic study of subcritical graph classes
Visualitza/Obre
Cita com:
hdl:2117/104308
Tipus de documentArticle
Data publicació2011-12-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
We present a unified general method for the asymptotic study of graphs from the so-called subcritical graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works in both the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number $g_n/n!$ (resp., $g_n$) of labelled (resp., unlabelled) graphs on n vertices from a subcritical graph class ${\mathcal{G}}=\cup_n {\mathcal{G}_n}$ satisfies asymptotically the universal behavior $g_n = c \!n^{-5/2} \!\gamma^n \! (1+o(1))$ for computable constants $c,\gamma$, e.g., $\gamma\approx 9.38527$ for unlabelled series-parallel graphs, and that the number of vertices of degree k (k fixed) in a graph chosen uniformly at random from $\mathcal{G}_n$ converges (after rescaling) to a normal law as $n\to\infty$.
CitacióDrmota, M., Fusy, É., Kang, M., Kraus, V., Rue, J. Asymptotic study of subcritical graph classes. "SIAM journal on discrete mathematics", 1 Desembre 2011, vol. 25, núm. 4, p. 1615-1651.
ISSN0895-4801
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
FINAL.pdf | 541,4Kb | Visualitza/Obre |