Descents in Noncrossing Trees
Author:
- David S. HoughDHDavid S. Hough
- 6 January 2003
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 10 (1) , N13
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.