1 Bijective Proofs of Identities from Colored Binary Trees
Abstract. This note provide bijective proofs of two combinatorial identities involving generalized Catalan number Cm,5(n) = recently proposed by Sun.
Binary tree, 5-ary trees, generalized Catalan number
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://arxiv.org/pdf/0805.3743... (external link)