- Published 2006 in Electr. J. Comb.

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ρn , where ρ is the radius of convergence of T.

Showing 1-10 of 20 references

Highly Influential

4 Excerpts

Highly Influential

10 Excerpts

Highly Influential

11 Excerpts

Highly Influential

10 Excerpts

Highly Influential

4 Excerpts

Highly Influential

6 Excerpts

Highly Influential

3 Excerpts

Highly Influential

3 Excerpts

Highly Influential

3 Excerpts

Highly Influential

3 Excerpts

@article{Bell2006CountingRT,
title={Counting Rooted Trees: The Universal Law t(n)~C ρ-n n-3/2},
author={Jason P. Bell and Stanley Burris and Karen A. Yeats},
journal={Electr. J. Comb.},
year={2006},
volume={13}
}