Bijections on rooted trees with fixed size of maximal decreasing subtrees
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][n] such that the image of f contains [k]. We give a bijective proof of this theorem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.