Geodesic
Cyclic sieving phenomenon in non-crossing connected graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A non-crossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a q-binomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon, as conjectured by S.-P. Eu.
DOI : 10.37236/496
Classification : 05A15, 05C30
Mots-clés : non-crossing graph, q-binomial generating function 
@article{10_37236_496,
     author = {Alan Guo},
     title = {Cyclic sieving phenomenon in non-crossing connected graphs},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/496},
     zbl = {1205.05010},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/496/}
}
TY  - JOUR
AU  - Alan Guo
TI  - Cyclic sieving phenomenon in non-crossing connected graphs
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/496/
DO  - 10.37236/496
ID  - 10_37236_496
ER  - 
%0 Journal Article
%A Alan Guo
%T Cyclic sieving phenomenon in non-crossing connected graphs
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/496/
%R 10.37236/496
%F 10_37236_496
Alan Guo. Cyclic sieving phenomenon in non-crossing connected graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/496

Cité par Sources :