On the enumeration of rooted trees with fixed size of maximal decreasing trees

From MaRDI portal
Publication:658069




Abstract: Let Tn be the set of rooted labeled trees on set0,...,n. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new refinement Tn,k of Tn, which is the set of rooted labeled trees whose maximal decreasing subtree has k+1 vertices.









This page was built for publication: On the enumeration of rooted trees with fixed size of maximal decreasing trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658069)