Refined enumeration of vertices among all rooted ordered d-trees
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WEDBFB5Krecord.jsonopen to challenge →
classification
math.CO
keywords
orderedrootedtreesverticescardinalitiesedgesenumerateenumeration
read the original abstract
In this paper we enumerate the cardinalities for the set of all vertices of outdegree $\ge k$ at level $\ge \ell$ among all rooted ordered $d$-trees with $n$ edges. Our results unite and generalize several previous works in the literature.
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.