Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
From MaRDI portal
Publication:2500982
zbMath1099.05023arXivmath/0512432MaRDI QIDQ2500982
Karen Yeats, Stanley N. Burris, Jason P. Bell
Publication date: 30 August 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512432
Trees (05C05) Enumeration in graph theory (05C30) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05) Asymptotic enumeration (05A16)
Related Items
Rerooting multi-type branching trees: the infinite spine case ⋮ Nonlinear analysis of a simple model of temperature evolution in a satellite ⋮ Anatomy of a gauge theory ⋮ Random enriched trees with applications to random graphs ⋮ On the number of matchings of a tree ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Scaling limits of random Pólya trees ⋮ Graphon convergence of random cographs ⋮ Counting graceful labelings of trees: a theoretical and empirical study ⋮ On the shape of random Pólya structures ⋮ Counting glycans revisited ⋮ Recursion and growth estimates in renormalizable quantum field theory ⋮ Graph limits of random unlabelled k-trees
