Cyclic sieving phenomenon in non-crossing connected graphs

Abstract

We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.