Descents in noncrossing trees
The electronic journal of combinatorics, Tome 10 (2003)
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.
@article{10_37236_1753,
author = {David S. Hough},
title = {Descents in noncrossing trees},
journal = {The electronic journal of combinatorics},
year = {2003},
volume = {10},
doi = {10.37236/1753},
zbl = {1031.05066},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1753/}
}
David S. Hough. Descents in noncrossing trees. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1753
Cité par Sources :