scientific article

zbMATH Open1313.05050MaRDI QIDQ2937604

László Béla Kovács

Publication date: 9 January 2015

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

zbMATH Keywords

approximationCatalan numbersrooted unordered binary treesweakly binary tree

Mathematics Subject Classification ID

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

Related Items (2)

On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees ⋮ Unbalanced subtrees in binary rooted ordered and un-ordered trees

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on the Horton-Strahler number for random binary search trees 👍 👎
• The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree 👍 👎
• Asymptotic number of forests from unrooted trees 👍 👎
• On the total heights of random rooted binary trees 👍 👎
• Asymptotics of the number of forests consisting of unrooted trees 👍 👎
• A remark on the enumeration of rooted labeled 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)