Cyclic sieving phenomenon in non-crossing connected graphs
Combinatorics
2010-07-28 v1
Abstract
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
Cite
@article{arxiv.1007.4584,
title = {Cyclic sieving phenomenon in non-crossing connected graphs},
author = {Alan Guo},
journal= {arXiv preprint arXiv:1007.4584},
year = {2010}
}
Comments
13 pages, 5 figures