On monotone functions of tree structures

DOI10.1016/0166-218X(83)90043-4zbMath0508.05042OpenAlexW2092844902MaRDI QIDQ1837700

Friedrich J. Urbanek, Prodinger, Helmut

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90043-4

zbMATH Keywords

ordered treest-ary treesaverage number of monotone bijectionsrooted tree structure

Mathematics Subject Classification ID

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

Related Items (17)

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics ⋮ Monotonically labelled Motzkin trees ⋮ A unifying approach for proving hook-length formulas for weighted tree families ⋮ Condensation phenomena in preferential attachment trees with neighbourhood influence ⋮ On the average hyperoscillations of planted plane trees ⋮ On the degree distribution of the nodes in increasing trees ⋮ On the number of increasing trees with label repetitions ⋮ Degree distributions in recursive trees with fitnesses ⋮ Shape Measures of Random Increasing k-trees ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ On the distribution of distances between specified nodes in increasing trees ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ Weakly increasing trees on a multiset ⋮ Statistical properties of the Burgers equation with Brownian initial velocity ⋮ On an asymptotic method in enumeration ⋮ Dynamical models for random simplicial complexes ⋮ On the average shape of monotonically labelled tree structures

Cites Work

• Une famille de polynômes ayant plusieurs propriétés enumeratives
• The number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On monotone functions of tree structures