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

MaRDI QIDQ2500982zbMATH OpenFDO

Authors Jason P. Bell, Stanley N. Burris, Karen Yeats

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, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r63.html

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

Mathematics Subject Classification ID

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

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.

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; zbMATH DE number 4134081

Cited in

(18)

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

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)