{
  "abstract": "Given graphs $G, H$ and an integer $q \\ge 2$, the generalized Ramsey number, denoted $r(G,H,q)$, is the minimum number of colours needed to edge-colour $G$ such that every copy of $H$ receives at least $q$ colours. In this paper, we prove that for a fixed integer $k \\ge 3$, we have $r(K_n,C_k,3) = n/(k-2)+o(n)$. This generalizes the work of Joos and Muybayi, who proved $r(K_n,C_4,3) = n/2+o(n)$. We also provide an upper bound on $r(K_{n,n}, C_k, 3)$, which generalizes a result of Joos and Mubayi that $r(K_{n,n},C_4,3) = 2n/3+o(n)$. Both of our results are in fact specific cases of more general theorems concerning families of cycles.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "name": "Natasha Morrison"
    },
    {
      "name": "Andrew Lane"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/4a794p3xacq1g.bib",
  "cited_by": 0,
  "doi": "10.37236/14492",
  "fulltext_url": null,
  "id": "4a794p3xacq1g",
  "issns": [
    "1077-8926"
  ],
  "landing_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p2",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W7221050787",
  "pdf_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i4p2/pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-09",
  "publisher": "The Electronic Journal of Combinatorics",
  "ris": "https://research.draconitic.com/paper/4a794p3xacq1g.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:24Z",
      "native_id": "10.37236/14492",
      "source": "crossref",
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p2"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "openalex:2607|Limits and Structures in Graph Theory",
      "subfield": "combinatorics"
    }
  ],
  "title": "Generalized Ramsey Numbers via Conflict-Free Hypergraph Matchings",
  "title_text": "Generalized Ramsey Numbers via Conflict-Free Hypergraph Matchings",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:18:24Z",
  "url": "https://research.draconitic.com/paper/4a794p3xacq1g",
  "venue": "The Electronic Journal of Combinatorics",
  "versions": []
}