Descents in noncrossing trees
The electronic journal of combinatorics, Tome 10 (2003)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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.
DOI : 10.37236/1753
Classification : 05C30, 05A15
Mots-clés : generating function
David S. Hough. Descents in noncrossing trees. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1753
@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/}
}
TY  - JOUR
AU  - David S. Hough
TI  - Descents in noncrossing trees
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1753/
DO  - 10.37236/1753
ID  - 10_37236_1753
ER  - 
%0 Journal Article
%A David S. Hough
%T Descents in noncrossing trees
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1753/
%R 10.37236/1753
%F 10_37236_1753

Cité par Sources :