Cyclic sieving phenomenon in non-crossing connected graphs
classification
🧮 math.CO
keywords
connectedcyclicgraphsnon-crossingphenomenonsievingconjecturedinstance
read the original abstract
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.