Cyclic sieving phenomenon in non-crossing connected graphs
arXiv:1007.4584
Abstract
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
13 pages, 5 figures
arXiv:1007.4584
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
13 pages, 5 figures