A REFINED ENUMERATION OF p-ARY LABELED TREES

초록

Let Tn(p) be the set of p-ary labeled trees on ｛1, 2, . . . , n｝. A maximal decreasing subtree of an p-ary labeled tree is de ned bythe maximal p-ary subtree from the root with all edges being de-creasing. In this paper, we study a new re nement Tn,k(p)n of Tn(p),which is the set of p-ary labeled trees whose maximal decreasingsubtree has k vertices.

키워드