A bijective enumeration of tiered trees

DOI10.1016/J.DISC.2020.111983zbMATH Open1443.05098OpenAlexW3027528004WikidataQ114190666 ScholiaQ114190666MaRDI QIDQ776308FDOQ776308

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

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

Recommendations

• Tiered trees, weights, and \(q\)-Eulerian numbers
• Proving identities on weight polynomials of tiered trees via Tutte polynomials
• A bijective enumeration of labeled trees with given indegree sequence
• Enumerating alternating trees
• Counting labelled trees with given indegree sequence

zbMATH Keywords

bijective proofintransitive treetiered tree

Mathematics Subject Classification ID

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

Cites Work

• Enumeration results for alternating tree families
• Title not available (Why is that?)
• Deformations of Coxeter hyperplane arrangements
• Intransitive trees
• Torus orbits on homogeneous varieties and Kac polynomials of quivers
• Enumerating alternating trees
• 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

Cited In (8)

• Proving identities on weight polynomials of tiered trees via Tutte polynomials
• A combinatorial bijection on di-sk trees
• Enumeration of binary trees compatible with a perfect phylogeny
• Enumeration of trees by inversions
• A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
• Tiered trees, weights, and \(q\)-Eulerian numbers
• Tiered Trees and Theta Operators
• The number of tiered posets modulo six

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

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