The edge-isoperimetric inequality for powers of cycles
Combinatorics
2026-01-13 v1
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 of size is achieved by a set of consecutive vertices.
Cite
@article{arxiv.2601.06912,
title = {The edge-isoperimetric inequality for powers of cycles},
author = {Kristiyan Vasilev},
journal= {arXiv preprint arXiv:2601.06912},
year = {2026}
}