Article ID Journal Published Year Pages File Type
4653926 European Journal of Combinatorics 2012 11 Pages PDF
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].

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,