Remarks on an asymptotic method in combinatorics

DOI10.1016/0097-3165(84)90055-4zbMath0551.05008OpenAlexW2032180500MaRDI QIDQ801061

E. Rodney Canfield

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90055-4

zbMATH Keywords

generating functionasymptotic formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (15)

Three-speed ballistic annihilation: phase transition and universality ⋮ Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree ⋮ Average case analysis of DJ graphs ⋮ On the number of matchings of a tree ⋮ Random trees in queueing systems with deadlines ⋮ Counting 5-connected planar triangulations ⋮ The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line ⋮ Asymptotic enumeration of RNA secondary structure ⋮ Combinatorial properties of a general domination problem with parity constraints ⋮ Recursion and growth estimates in renormalizable quantum field theory ⋮ On the parity of the Wiener index ⋮ On an asymptotic method in enumeration ⋮ Combinatorics of RNA secondary structures ⋮ Analytic combinatorics of non-crossing configurations ⋮ A survey of the asymptotic behaviour of maps

Cites Work

• Unnamed Item
• Asymptotic Methods in Enumeration

This page was built for publication: Remarks on an asymptotic method in combinatorics