Cyclic Sieving Phenomenon in Non-Crossing Connected Graphs
Keyword(s):
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.
2011 ◽
Vol DMTCS Proceedings vol. AO,...
(Proceedings)
◽
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
2018 ◽
Vol 12
(2)
◽
pp. 297-317
Keyword(s):