arXiv:1007.4584 Abstract | arXiv Analytics

Published 2010-07-26Version 1

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

Comments: 13 pages, 5 figures

Categories: math.CO

Subjects: 05A15, 05C30

Keywords: cyclic sieving phenomenon, non-crossing connected graphs

Related articles: Most relevant | Search more

arXiv:1106.0992 [math.CO] (Published 2011-06-06)

The Cyclic Sieving Phenomenon for non-crossing forests

Stefan Kluge

arXiv:1004.0747 [math.CO] (Published 2010-04-06, updated 2011-01-11)

Constructions for cyclic sieving phenomena

arXiv:2303.09605 [math.CO] (Published 2023-03-16)

A cyclic sieving phenomenon for symplectic tableaux