The enumeration of the subclass labeled ternary trees studied by Brain Drake is a combinatorial problem related to Catalan number.A bijection and a half-combinatorial proof of the main theorem and more generalized cases of labeled trees with generating function are given in this paper.
关键词
Keywords
references
Gessel I M.Generatin functions and enumeration of sequences[D].Boston:Massachusetts Institute of Technology,1977.
Goulden I P,Pepper S.Labeled trees and factorizations of a cycle into transpositions[J].Discrete Mathematics,1993,113:263-268.
Postnikov A.Intransitive trees[J].Journal of Combinatorial Theory(Series A),1997,79:360-366.
Prodinger H.A simple bijection between a subclass of2-binary trees and ternary trees[J].Discrete Mathematics,2009,309:959-961.
Stanley R.Enumeration of combinatorics Vol.2[M].Cambridge:Cambridge University Press,1999.
Drake B.An inversion theorem for labeled trees and some limits of areas under lattice paths[D].Brandeis:Brandeis University,2008.
京公网安备11010802024621