The asymptotic behaviour of the number of trees in certain classes

zbMATH Open1432.05054MaRDI QIDQ5222084FDOQ5222084

Authors: Jan-Christoph Schlage-Puchta 

Publication date: 30 March 2020

Recommendations

• On an asymptotic method in enumeration
• scientific article; zbMATH DE number 58317
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
• scientific article; zbMATH DE number 2232270
• scientific article; zbMATH DE number 3865301

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) First-order arithmetic and fragments (03F30)

Cited In (6)

• Title not available (Why is that?)
• Properties related to the function of the number of undirected non-isomorphic trees
• The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.
• Asymptotic results on Hoppe trees and their variations
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
• Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)

This page was built for publication: The asymptotic behaviour of the number of trees in certain classes

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