Descents in Noncrossing Trees

  • David S. Hough
DOI: https://doi.org/10.37236/1753

Abstract

The generating function for descents in noncrossing trees is found. A bijection shows combinatorially why the descent generating function with descents set equal to $2$ is the generating function for connected noncrossing graphs.

Published
2003-10-13
How to Cite
Hough, D. S. (2003). Descents in Noncrossing Trees. The Electronic Journal of Combinatorics, 10(1), N13. https://doi.org/10.37236/1753
Issue
Volume 10 (2003)
Article Number
N13