{
  "annotation_id": "efcfc808-c1cf-4725-b0ae-87ce77c8364c",
  "date_created": "2026-02-17T05:53:08.506000Z",
  "date_modified": "2026-02-17T05:53:08.506000Z",
  "file_hash": "88c9d9f798a71ef78e1325570bb85f9ac19b8bef0604ca2be440edfddfddb047",
  "private": false,
  "record": {
    "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.",
    "arxiv_id": "2601.06912",
    "authors": [
      "Kristiyan Vasilev"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "The edge-isoperimetric inequality for powers of cycles",
    "url": "https://arxiv.org/abs/2601.06912",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f2ef72ab-4452-4dbd-90fd-7f1611be08ec",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}