The edge-isoperimetric inequality for powers of cycles
Abstract
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.
Fields of Study & Subjects
Limits and Structures in Graph Theory
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 11 January 2026
- Document type
- Preprint