Enumerating alternating trees
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- The pessimistic search and the straightening involution for trees
- Rooted forests that avoid sets of permutations
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- Root cones and the resonance arrangement
- Embedding small digraphs and permutations in binary trees and split trees
- Enumerating Ordered Trees Lexicographically
- scientific article; zbMATH DE number 6928770 (Why is no real title available?)
- Enumeration of trees by inversions
- Increasing trees and alternating permutations
- Some equidistributed statistics and applications to hook length formulas
- Enumeration results for alternating tree families
- Alternating Whitney sums and matchings in trees. II
- A bijective enumeration of tiered trees
This page was built for publication: Enumerating alternating trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937130)