English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Assume that $K_{j\times n}$ be a complete, multipartite graph consisting of$j$ partite sets and $n$ vertices in each partite set. For given graphs $G_1,G_2,\ldots, G_n$, the multipartite Ramsey number (M-R-number) $m_j(G_1, G_2,\ldots,G_n)$ is the smallest integer $t$ such that for any $n$-edge-coloring$(G^1,G^2,\ldots, G^n)$ of the edges of $K_{j\times t}$, $G^i$ contains amonochromatic copy of $G_i$ for at least one $i$. The size of M-R-number$m_j(nK_2, C_m)$ for $j, n\geq 2$ and $4\leq m\leq 6$, the size of M-R-number$m_j(nK_2, C_7)$ for $j \geq 2$ and $n\geq 2$, the size of M-R-number$m_j(nK_2,K_3)$, for each $j,n\geq 2$, the size of M-R-number $m_j(K_3,K_3,n_1K_2,n_2K_,\ldots,n_iK_2)$ for $j \leq 6$ and $i,n_i\geq 1$ and the size ofM-R-number $m_j(K_3,K_3, nK_2)$ for $j \geq 2$ and $n\geq 1$ have been computedin several papers up to now. In this article we obtain the values of M-R-number$m_j(K_m, nK_2)$, for each $j,n\geq 2$ and each $m\geq 4$.

Multipartite Ramsey number $m_j(K_m, nK_2)$