Two-color multipartite Ramsey numbers of matchings and cycles
Contributions to Discrete Mathematics · 2026
DOI: 10.55016/nj6dej18 ↗Kurz gefasst
Fachartikel in der Zeitschrift Contributions to Discrete Mathematics, 2026. Verfasst von Mostafa Gholami und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-ND 4.0).
Abstract (Originalsprache)
Let $K_{j\times n}$ denote a complete multipartite graph with $j$ partite sets, each containing $n$ vertices. For given graphs $G_1$ and $G_2$, the multipartite Ramsey number $m_j(G_1,G_2)$ is the smallest integer $t$ such that any subgraph $G$ of $K_{j\times t}$ either contains a copy of $G_1$, or its complement relative to $K_{j\times t}$ contains a copy of $G_2$. The exact values of $m_j(nK_2,C_m)$ are known for several values of $j$ and $m$. The problem is fully resolved for $m\leq 6$, while for $m=7$ the exact values were previously known for $j\leq 4$. In this article, we determine $m_j(nK_2,C_7)$ for $j\geq 5$ and $n\geq 2$, completing the remaining cases for $m=7$.
Zitieren
APA
Gholami, M., & Rowshan, Y. (2026). Two-color multipartite Ramsey numbers of matchings and cycles. Contributions to Discrete Mathematics. https://doi.org/10.55016/nj6dej18
Vancouver
Gholami M, Rowshan Y. Two-color multipartite Ramsey numbers of matchings and cycles. Contributions to Discrete Mathematics. 2026. doi:10.55016/nj6dej18
BibTeX
@article{Gholami2026,
author = {Gholami, Mostafa and Rowshan, Yaser},
title = {Two-color multipartite Ramsey numbers of matchings and cycles},
journal = {Contributions to Discrete Mathematics},
year = {2026},
doi = {10.55016/nj6dej18}
}
EUVIMED