On the number of increasing trees with label repetitions

DOI10.1016/j.disc.2019.111722zbMath1441.05047arXiv1809.04314OpenAlexW2988328148WikidataQ126796183 ScholiaQ126796183MaRDI QIDQ2185898

Yanyan Li

Publication date: 8 June 2020

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

Full work available at URL: https://arxiv.org/abs/1809.04314

zbMATH Keywords

ordinary differential equationBorel transformasymptotic enumerationincreasing treeevolution process

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (3)

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics ⋮ Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study ⋮ Weakly increasing trees on a multiset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonically labelled Motzkin trees
• Analytic urns
• On monotone functions of tree structures
• Entropic uniform sampling of linear extensions in series-parallel posets
• Singularity Analysis of Generating Functions
• Random Trees
• The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
• Ranked Schröder Trees
• 3295. Approximate evaluation of Euler’s constant

This page was built for publication: On the number of increasing trees with label repetitions