Asymptotic Study of Subcritical Graph Classes

DOI10.1137/100790161zbMath1237.05103arXiv1003.4699OpenAlexW3103129687MaRDI QIDQ3225143

Veronika Kraus, Michael Drmota, Juanjo Rué, Mihyun Kang, Éric Fusy

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4699

zbMATH Keywords

asymptotic enumerationrandom graphanalytic combinatoricslimit law

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16)

Related Items (28)

An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Characterisation of symmetries of unlabelled triangulations ⋮ Enumeration of labeled connected graphs with given order and size ⋮ Asymptotic Properties of Some Minor-Closed Classes of Graphs ⋮ Random enriched trees with applications to random graphs ⋮ Enumeration of labeled geodetic graphs with small cyclomatic number ⋮ A central limit theorem for the number of degree-\(k\) vertices in random maps ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ On the number of labeled outerplanar $k$-cyclic bridgeless graphs ⋮ On the distribution of betweenness centrality in random trees ⋮ Random graphs from a weighted minor-closed class ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Limits of random tree-like discrete structures ⋮ Asymptotic enumeration and limit laws for multisets: the subexponential case ⋮ Many 2-level polytopes from matroids ⋮ Combinatorics of locally optimal RNA secondary structures ⋮ Enumeration of labelled 4-regular planar graphs. II: Asymptotics ⋮ On graphs with few disjoint \(t\)-star minors ⋮ Asymptotic number of hairpins of saturated RNA secondary structures ⋮ Logical limit laws for minor-closed classes of graphs ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Chordal graphs with bounded tree-width ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Random graphs from a block-stable class ⋮ Subcritical Graph Classes Containing All Planar Graphs ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs ⋮ Enumeration of chordal planar graphs and maps ⋮ Spanning trees in random series-parallel graphs

This page was built for publication: Asymptotic Study of Subcritical Graph Classes