Combinatorial proof of the Prodinger formulas about binary trees

zbMath0886.05008MaRDI QIDQ1380716

Guo-Niu Han

Publication date: 12 March 1998

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/SLC/wpapers/s38proding.html

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (1)

On the number of vertices with a given degree in a Galton-Watson tree

This page was built for publication: Combinatorial proof of the Prodinger formulas about binary trees