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

DOI10.1016/J.DISC.2011.10.001zbMATH Open1237.05105arXiv1106.1290OpenAlexW2115439754MaRDI QIDQ658069FDOQ658069

Seung-Hyun Seo, Heesung Shin

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $T_n$ be the set of rooted labeled trees on $set0,\mathrm{...},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 $T_{n,k}$ of $T_n$, which is the set of rooted labeled trees whose maximal decreasing subtree has $k+1$ vertices.

Full work available at URL: https://arxiv.org/abs/1106.1290

Recommendations

• Bijections on rooted trees with fixed size of maximal decreasing subtrees
• A remark on the enumeration of rooted labeled trees
• scientific article; zbMATH DE number 695765
• scientific article; zbMATH DE number 3849252
• Refined enumeration of vertices among all rooted ordered \(d\)-trees

zbMATH Keywords

enumerationmaximal decreasing subtreerooted labeled trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• A combinatorial basis for the free Lie algebra of the labelled rooted trees
• Title not available (Why is that?)

Cited In (6)

• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• A REFINED ENUMERATION OF p-ARY LABELED TREES
• Enumerations of vertices among all rooted ordered trees with levels and degrees
• A REFINEMENT FOR ORDERED LABELED TREES
• Runs in labelled trees and mappings
• Bijections on rooted trees with fixed size of maximal decreasing subtrees

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)