Level number sequences for trees

DOI10.1016/0012-365X(87)90137-3zbMath0634.05021OpenAlexW2083368438MaRDI QIDQ1096638

Philippe Flajolet, Prodinger, Helmut

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90137-3

zbMATH Keywords

asymptotic enumerationenumeration of treeslevel number sequenceq- series

Mathematics Subject Classification ID

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

Related Items (12)

Compositions into powers of \(b\): asymptotic enumeration and parameters ⋮ Profile of random exponential binary trees ⋮ Large deviations for combinatorial distributions. I: Central limit theorems ⋮ Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis ⋮ Philippe Flajolet's early work in combinatorics ⋮ Unbounding Ext. ⋮ Ascents of size less than \(d\) in compositions ⋮ Level number sequences of trees and the lambda algebra ⋮ Bounding size of homotopy groups of Spheres ⋮ On the vector space of the automatic reals ⋮ Revisiting Shao and Sokal's \(B_2\) index of phylogenetic balance ⋮ The Gini index of random trees with an application to caterpillars

Cites Work

• The average height of binary trees and other simple trees
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Level number sequences for trees