An insertion algorithm and leaders of rooted trees

DOI10.1016/J.EJC.2015.10.008MaRDI QIDQ901150zbMATH OpenOpenAlexFDO

Authors Qing-Hu Hou

Publication date 23 December 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2015.10.008

zbMATH Keywords

random rooted tree

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• Asymptotic properties of the number of inversions in a random forest
• The shape of unlabeled rooted random trees
• Ascents and descents in random trees
• scientific article; zbMATH DE number 4008409

Cites work

• scientific article; zbMATH DE number 2186866 (Why is no real title available?)
• scientific article; zbMATH DE number 6909312 (Why is no real title available?)
• scientific article; zbMATH DE number 1245629 (Why is no real title available?)
• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
• A generalization of the Ramanujan polynomials and plane trees
• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• A refinement of Cayley's formula for trees
• A unifying approach for proving hook-length formulas for weighted tree families
• Bilabelled increasing trees and hook-length formulae
• Disposition polynomials and plane trees
• Enumeration results for alternating tree families
• Hook length polynomials for plane forests of a certain type
• On Postnikov's hook length formula for binary trees
• Postnikov identities and Seo's formulas
• Probabilistic proofs of hook length formulas involving trees
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• \((k,m)\)-Catalan numbers and hook length polynomials for plane trees

Cited in

(6)

• A bijective proof of the Shor recurrence
• Insertion depth in power-weight trees
• Some enumerative properties of parking functions
• Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
• A recursive algorithm for trees and forests
• Rooted forests that avoid sets of permutations

This page was built for publication: An insertion algorithm and leaders of rooted trees

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