Counting forests by descents and leaves

zbMath0858.05054MaRDI QIDQ1918883

Ira M. Gessel

Publication date: 21 July 1996

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119053

zbMATH Keywords

descentrooted treeleafcounting forests

Mathematics Subject Classification ID

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

Related Items (6)

Rooted forests that avoid sets of permutations ⋮ Gamma-positivity in combinatorics and geometry ⋮ Partial fraction decompositions and trigonometric sum identities ⋮ Tree descent polynomials: unimodality and central limit theorem ⋮ Runs in labelled trees and mappings ⋮ Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity

This page was built for publication: Counting forests by descents and leaves