The edge-isoperimetric inequality for powers of cycles
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909987411853312 |
|---|---|
| author | Vasilev, Kristiyan |
| author_facet | Vasilev, Kristiyan |
| contents | This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set of $k$ consecutive vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_06912 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The edge-isoperimetric inequality for powers of cycles Vasilev, Kristiyan Combinatorics This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set of $k$ consecutive vertices. |
| title | The edge-isoperimetric inequality for powers of cycles |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.06912 |