A combinatorial identity concerning plane colored trees and its applications

MaRDI QIDQ2963483zbMATH OpenFDO

Authors Ricky X. F. Chen, Christian M. Reidys

Publication date 14 February 2017

Full work available at URL http://www.emis.de/journals/JIS/VOL20/Chen/chen32.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Harer-Zagier formulaNarayana polynomialcolored treeStanley's bijective proof problem

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15)

Recommendations

• An identity involving Narayana numbers
• A new combinatorial identity for unicellular maps, via a direct bijective approach
• scientific article; zbMATH DE number 6909270
• A simple model of trees for unicellular maps
• A combinatorial identity with applications to forest graphs

Cited in

(5)

• Egorychev method for proving combinatorial identities involving Narayana polynomials
• A generalization of the Ramanujan polynomials and plane trees
• scientific article; zbMATH DE number 1919510 (Why is no real title available?)
• On generating series of coloured planar trees
• A combinatorial identity with applications to forest graphs

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A combinatorial identity concerning plane colored trees and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963483)