Cyclic Sieving Phenomenon for Independent sets of graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917460543799296 |
|---|---|
| author | White, Jacob A |
| author_facet | White, Jacob A |
| contents | In this paper, we present examples of the cyclic sieving phenomenon coming from studying independent sets in graphs of a fixed size k. Given a graph G, and a cyclic group C acting on the graph, then C also acts on the collection of independent sets of G of a fixed size k. We exhibit cyclic sieving phenomena for a cyclic group acting on the collection of independent sets of powers of cycle graphs. As a corollary, we also find a closed formula for the number of independent sets of a given size in the power of a cycle graph, and in the power of a path. We also show how the graph construction of whiskering can be used to obtain new cyclic sieving phenomena from old phenomena. We also discuss recursive techniques to exhibit cyclic sieving phenomena for the independent sets of gear graphs, helm graphs, and book graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_03083 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Cyclic Sieving Phenomenon for Independent sets of graphs White, Jacob A Combinatorics 05C30, 05C69, 05E18 In this paper, we present examples of the cyclic sieving phenomenon coming from studying independent sets in graphs of a fixed size k. Given a graph G, and a cyclic group C acting on the graph, then C also acts on the collection of independent sets of G of a fixed size k. We exhibit cyclic sieving phenomena for a cyclic group acting on the collection of independent sets of powers of cycle graphs. As a corollary, we also find a closed formula for the number of independent sets of a given size in the power of a cycle graph, and in the power of a path. We also show how the graph construction of whiskering can be used to obtain new cyclic sieving phenomena from old phenomena. We also discuss recursive techniques to exhibit cyclic sieving phenomena for the independent sets of gear graphs, helm graphs, and book graphs. |
| title | Cyclic Sieving Phenomenon for Independent sets of graphs |
| topic | Combinatorics 05C30, 05C69, 05E18 |
| url | https://arxiv.org/abs/2605.03083 |