Asymptotic Properties of Some Minor-Closed Classes of Graphs
From MaRDI portal
Publication:3191199
DOI10.1017/S0963548314000303zbMath1298.05162arXiv1303.3836OpenAlexW2801483025MaRDI QIDQ3191199
Kerstin Weller, Mireille Bousquet-Mélou
Publication date: 24 September 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.3836
Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Graph minors (05C83)
Related Items (2)
Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Logical limit laws for minor-closed classes of graphs
Cites Work
- Degree distribution in random planar graphs
- On graphs with few disjoint \(t\)-star minors
- Marking in combinatorial constructions: Generating functions and limiting distributions
- Growth constants of minor-closed classes of graphs
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Largest component in random combinatorial structures
- Random planar graphs
- On the Lambert \(w\) function
- On the connectivity of random graphs from addable classes
- Proper minor-closed families are small
- Operational methods and the coefficients of certain power series
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
- Connectivity for Bridge-Addable Monotone Graph Classes
- Asymptotic Study of Subcritical Graph Classes
- The Degree Sequence of Random Graphs from Subcritical Classes
- Random Graphs from a Minor-Closed Class
- Asymptotic Methods in Enumeration
- The number of connected sparsely edged graphs
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Extended admissible functions and Gaussian limiting distributions
- Unnamed Item
- Unnamed Item
This page was built for publication: Asymptotic Properties of Some Minor-Closed Classes of Graphs
