M. Gholami

Two-color multipartite Ramsey numbers of matchings and cycles

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 (denoted $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 com...