On an asymptotic method in enumeration
Authors:
- A MeirAMA Meir
- J.W MoonJMJ.W Moon
- 1 May 1989
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 51 (1) , 77-89
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Some asymptotic results useful in enumeration problemsAequationes mathematicae, 1987
- The asymptotic number of rooted maps on a surfaceJournal of Combinatorial Theory, Series A, 1986
- Twenty-step algorithm for determining the asymptotic number of trees of various species: corrigendaJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1986
- Remarks on an asymptotic method in combinatoricsJournal of Combinatorial Theory, Series A, 1984
- On monotone functions of tree structuresDiscrete Applied Mathematics, 1983
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- Twenty-step algorithm for determining the asymptotic number of trees of various specesJournal of the Australian Mathematical Society, 1975
- Asymptotic Methods in EnumerationSIAM Review, 1974
- The Number of TreesAnnals of Mathematics, 1948
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937