Wright and Stepanov-Wrigth coefficients

DOI10.1007/BF01137454zbMath0698.05037OpenAlexW2069295842MaRDI QIDQ912121

V. A. Voblyj

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01137454

zbMATH Keywords

asymptoticsenumerationconnected sparsely graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60)

Related Items

The birth of the giant component, The asymptotic number of labeled connected graphs with a given number of vertices and edges, On the asymptotic enumeration of labeled connected \(k\)-cyclic graphs without bridges, On the largest component of the random graph at a nearcritical stage

Cites Work

• An asymptotic expansion for the coefficients of some power series. II: Lagrange inversion
• Enumeration of smooth labelled graphs
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item