A Recurrence Related to Trees
Open Access
- 1 February 1989
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 105 (2) , 335-349
- https://doi.org/10.2307/2046947
Abstract
The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer coefficients, which may be called the "tree polynomials."Keywords
This publication has 6 references indexed in Scilit:
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- Gaussian limiting distributions for the number of components in combinatorial structuresJournal of Combinatorial Theory, Series A, 1990
- An analysis of optimum cachingJournal of Algorithms, 1985
- The expected linearity of a simple equivalence algorithmTheoretical Computer Science, 1978
- Combinatorial IdentitiesMathematics of Computation, 1969
- Limit Distributions of Certain Characteristics of Random MappingsTheory of Probability and Its Applications, 1969