A refinement for ordered labeled trees
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:N65UWGSQrecord.jsonopen to challenge →
classification
math.CO
keywords
orderedlabeleddecreasingmathcalmaximalsubtreetreesrefinement
read the original abstract
Let $\mathcal{O}_n$ be the set of ordered labeled trees on ${0,...,n}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\mathcal{O}_{n,k}$ of $\mathcal{O}_n$, which is the set of ordered labeled trees whose maximal decreasing subtree has $k+1$ vertices.
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.