Title of article
Bilabelled increasing trees and hook-length formulae
Author/Authors
Kuba، نويسنده , , Markus and Panholzer، نويسنده , , Alois، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
11
From page
248
To page
258
Abstract
We introduce two different kinds of increasing bilabellings of trees, for which we provide enumeration formulae. One of the bilabelled tree families considered is enumerated by the reduced tangent numbers and is in bijection with a tree family introduced by Poupard [11]. Both increasing bilabellings naturally lead to hook-length formulae for trees and forests; in particular, one construction gives a combinatorial interpretation of a formula for labelled unordered forests obtained recently by Chen et al. [1].
Journal title
European Journal of Combinatorics
Serial Year
2012
Journal title
European Journal of Combinatorics
Record number
1547248
Link To Document