Graph limits of random unlabelled k-trees
From MaRDI portal
Publication:4987257
DOI10.1017/S0963548320000164zbMath1467.05246arXiv1801.10097OpenAlexW3028128315MaRDI QIDQ4987257
Publication date: 30 April 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.10097
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The specification of 2-trees
- Une théorie combinatoire des séries formelles
- Functionals of Brownian meander and Brownian excursion
- Random enriched trees with applications to random graphs
- \(\Gamma \)-species and the enumeration of \(k\)-trees
- Limits of random tree-like discrete structures
- Scaling limits of random outerplanar maps with independent link-weights
- Counting unlabeled \(k\)-trees
- Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
- Enumerating k-trees
- The number of trees
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Tessellations of random maps of arbitrary genus
- Limiting Distribution for Distances in k-Trees
- Gibbs partitions: The convergent case
- Graph limits of random graphs from a subset of connected k‐trees
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- The number of labeled k-trees
This page was built for publication: Graph limits of random unlabelled k-trees
