Cyclic sieving phenomenon in non-crossing connected graphs

zbMath1205.05010arXiv1007.4584MaRDI QIDQ625371

Alan Guo

Publication date: 17 February 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4584

zbMATH Keywords

non-crossing graphq-binomial generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (2)

Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux ⋮ Unnamed Item

This page was built for publication: Cyclic sieving phenomenon in non-crossing connected graphs