Bijective Proofs of Identities from Colored Binary Trees
Abstract
This note provides bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.
Published
2008-06-13
How to Cite
Yan, S. H. (2008). Bijective Proofs of Identities from Colored Binary Trees. The Electronic Journal of Combinatorics, 15(1), N20. https://doi.org/10.37236/895
Issue
Article Number
N20