Name
Abstract | ||
|---|---|---|
A non-crossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a q-binomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon, as conjectured by S.-P. Eu. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.37236/496 | ELECTRONIC JOURNAL OF COMBINATORICS |
Keywords | DocType | Volume |
connected graph | Journal | 18.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 1 |
PageRank | References | Authors |
0.36 | 3 | 1 |