Spanning trees in random series-parallel graphs
From MaRDI portal
Publication:256329
DOI10.1016/j.aam.2015.12.001zbMath1331.05061arXiv1503.01922OpenAlexW1643513466MaRDI QIDQ256329
Publication date: 9 March 2016
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01922
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic enumeration (05A16) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning forests in regular planar maps
- Enumerating simplicial decompositions of surfaces with boundaries
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems
- A characterization of the Tutte polynomial via combinatorial embeddings
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- A complete grammar for decomposing a family of graphs into 3-connected components
- Spanning trees in regular graphs
- Shuffle of parenthesis systems and Baxter permutations
- Counting labelled three-connected and homeomorphically irreducible two- connected graphs
- On convergence rates in the central limit theorems for combinatorial structures
- Asymptotic enumeration of non-crossing partitions on surfaces
- Enumeration and limit laws for series-parallel graphs
- Two critical periods in the evolution of random planar graphs
- Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
- Vertices of given degree in series-parallel graphs
- Asymptotic enumeration and limit laws of planar graphs
- Asymptotic Study of Subcritical Graph Classes
- Random cubic planar graphs
- Singularity Analysis of Generating Functions
- Random Trees
- The Degree Sequence of Random Graphs from Subcritical Classes
- The number of spanning trees in regular graphs
- The number of connected sparsely edged graphs
- The number of connected sparsely edged graphs. II. Smooth graphs and blocks
- Graph Classes: A Survey
- The number of spanning trees in graphs with a given degree sequence
- Handbook of Enumerative Combinatorics
- Extremal Parameters in Sub-Critical Graph Classes
- The Maximum Degree of Series-Parallel Graphs
- The birth of the giant component
- On the probability of planarity of a random graph near the critical point
- On the Enumeration of Tree-Rooted Maps
- Asymptotic Enumeration of Spanning Trees
This page was built for publication: Spanning trees in random series-parallel graphs
