Coefficients of Functional Compositions Often Grow Smoothly
Open Access
- 1 January 2008
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 15 (1) , R21
Abstract
The coefficients of a power series $A(x)$ are smooth if $a_{n-1}/a_n$ approaches a limit. If $A(x)=F(G(x))$ and $f_n^{1/n}$ approaches a limit, then the coefficients of $A(x)$ are often smooth. We use this to show that the coefficients of the exponential generating function for graphs embeddable on a given surface are smooth, settling a problem of McDiarmid.
Keywords
This publication has 2 references indexed in Scilit:
- Random graphs on surfacesJournal of Combinatorial Theory, Series B, 2008
- Random planar graphsJournal of Combinatorial Theory, Series B, 2005