scientific article; zbMATH DE number 6385357

zbMATH Open1313.05050MaRDI QIDQ2937604FDOQ2937604

Authors: László Béla Kovács 

Publication date: 9 January 2015

Title of this publication is not available (Why is that?)

Recommendations

• A remark on the enumeration of rooted labeled trees
• Asymptotics of the number of forests consisting of unrooted trees
• On the total heights of random rooted binary trees
• Asymptotic number of forests from unrooted trees
• scientific article; zbMATH DE number 568825
• The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
• Note on the number of rooted complete \(N\)-ary trees.
• scientific article; zbMATH DE number 4081578
• A note on the Horton-Strahler number for random binary search trees

zbMATH Keywords

approximationCatalan numbersrooted unordered binary treesweakly binary tree

Mathematics Subject Classification ID

Trees (05C05) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Cited In (3)

• An approximate formula for counting trees in a graph
• Unbalanced subtrees in binary rooted ordered and un-ordered trees
• On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937604)