{
  "annotation_id": "e7023c14-2bfc-4247-a296-b0ca57f22531",
  "date_created": "2026-02-17T05:53:24.224000Z",
  "date_modified": "2026-02-17T05:53:24.224000Z",
  "file_hash": "1f0518e7dde45e934823950a4d878245148dd0f8833329465996e50b16f65dcb",
  "private": false,
  "record": {
    "abstract": "In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $2m+\\lfloor \\frac{k-1}{2} \\rfloor$, provided $m$ is sufficiently large with respect to $k$. This settles a problem of Erd\\H{o}s, Faudree, Rousseau and Schelp.",
    "arxiv_id": "2601.10238",
    "authors": [
      "Stijn Cambie",
      "Andrea Freschi",
      "Patryk Morawski",
      "Kalina Petrova",
      "Alexey Pokrovskiy"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Ramsey number of a cycle versus a graph of a given size",
    "url": "https://arxiv.org/abs/2601.10238",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c2ba2490-b0e7-4caa-81f2-463d44aed9eb",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}