Counting rooted trees: the universal law t(n) C^-n n^-3/2

zbMATH Open1099.05023arXivmath/0512432MaRDI QIDQ2500982FDOQ2500982

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)

Abstract: Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence; for most of these a simple test can be used to quickly show that the form of the asymptotics is the same as that for the class of rooted trees: C ho^{-n} n^{-3/2} where ho is the radius of convergence of T.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The asymptotic behaviour of the number of trees in certain classes
• Asymptotics of the number of forests consisting of unrooted trees
• On an asymptotic method in enumeration
• The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.
• scientific article

Mathematics Subject Classification ID

Trees (05C05) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05)

Cited In (14)

• Asymptotic properties of random unlabelled block-weighted graphs
• A Recurrence Related to Trees
• Graph limits of random unlabelled k-trees
• Rerooting multi-type branching trees: the infinite spine case
• Recursion and growth estimates in renormalizable quantum field theory
• Counting glycans revisited
• Graphon convergence of random cographs
• Nonlinear analysis of a simple model of temperature evolution in a satellite
• Counting graceful labelings of trees: a theoretical and empirical study
• Scaling limits of random Pólya trees
• On the shape of random Pólya structures
• Anatomy of a gauge theory
• Random enriched trees with applications to random graphs
• On the number of matchings of a tree

This page was built for publication: Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500982)