Bijections on rooted trees with fixed size of maximal decreasing subtrees
classification
🧮 math.CO
keywords
decreasingmaximalnumberrootedtreesbijectionsbijectivecontains
read the original abstract
Seo and Shin showed that the number of rooted trees on $[n+1]$ such that the maximal decreasing subtree with the same root has $k+1$ vertices is equal to the number of functions $f:[n]\to[n]$ such that the image of $f$ contains $[k]$. We give a bijective proof of this theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.