The number of degree-restricted rooted maps on the sphere
EA Bender, ER Canfield - SIAM Journal on Discrete Mathematics, 1994 - SIAM
Let D be a set of positive integers. Let m(n) be the number of n edged rooted maps on the
sphere all of whose vertex degrees (or, dually, face degrees) lie in D. Using Brown's
technique, the generating function for m(n) implicitly is obtained. It is used to prove that,
when \gcd(D) is even, m(n)∼C(D)n^-5/2γ(D)^n. It also yields known formulas for various
special D.
sphere all of whose vertex degrees (or, dually, face degrees) lie in D. Using Brown's
technique, the generating function for m(n) implicitly is obtained. It is used to prove that,
when \gcd(D) is even, m(n)∼C(D)n^-5/2γ(D)^n. It also yields known formulas for various
special D.
[PDF][PDF] The number of degree restricted rooted maps on the sphere Edward A. Bender Department of Mathematics University of California, San Diego La Jolla, CA …
ER Canfield - math.ucsd.edu
Let D be a set of positive integers. Let m (n) be the number of n edged rooted maps on the
sphere all of whose vertex degrees (or, dually, face degrees) lie in D. Using Brown's
technique, we obtain the generating function for m (n) implicitly. We use it to prove that,
when gcd (D) is even, m (n)∼ C (D) n− 5/2 γ (D) n.
sphere all of whose vertex degrees (or, dually, face degrees) lie in D. Using Brown's
technique, we obtain the generating function for m (n) implicitly. We use it to prove that,
when gcd (D) is even, m (n)∼ C (D) n− 5/2 γ (D) n.
Showing the best results for this search. See all results