A bijective enumeration of tiered trees

DOI10.1016/j.disc.2020.111983zbMath1443.05098OpenAlexW3027528004WikidataQ114190666 ScholiaQ114190666MaRDI QIDQ776308

Hao Zhou, Danna Yan, Sherry H. F. Yan

Publication date: 8 July 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111983

zbMATH Keywords

bijective proofintransitive treetiered tree

Mathematics Subject Classification ID

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

Related Items (1)

Proving identities on weight polynomials of tiered trees via Tutte polynomials

Cites Work

• Unnamed Item
• Torus orbits on homogeneous varieties and Kac polynomials of quivers
• Enumeration results for alternating tree families
• Intransitive trees
• Deformations of Coxeter hyperplane arrangements
• Tiered trees, weights, and \(q\)-Eulerian numbers
• Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
• The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
• Enumerating alternating trees

This page was built for publication: A bijective enumeration of tiered trees