Bijections on rooted trees with fixed size of maximal decreasing subtrees
From MaRDI portal
Publication:360359
DOI10.1007/s00026-013-0182-9zbMath1270.05057arXiv1108.6038MaRDI QIDQ360359
Publication date: 26 August 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.6038
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the enumeration of rooted trees with fixed size of maximal decreasing trees
- A refinement of Cayley's formula for trees
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
- A combinatorial basis for the free Lie algebra of the labelled rooted trees