Corpus ID: 237940115

# The Multipartite Ramsey numbers $m_j(C_3, C_m, n_1K_2,n_2K_2,\ldots, n_iK_2)$

@inproceedings{Rowshan2021TheMR,
title={The Multipartite Ramsey numbers \$m\_j(C\_3, C\_m, n\_1K\_2,n\_2K\_2,\ldots, n\_iK\_2)\$},
author={Yaser Rowshan},
year={2021}
}
Assume that Kj×n be a complete, multipartite graph consisting of j partite sets and n vertices in each partite set. For given graphs G1, G2, . . . , Gn, the multipartite Ramsey number (M-R-number) mj(G1, G2, . . . , Gn) is the smallest integer t such that for any n-edge-coloring (G, G, . . . , G) of the edges of Kj×t, G i contains a monochromatic copy of Gi for at least on i. C. J. Jayawardene, E. T. Baskoro et al. (2016) gave the size of M-R-numbe mj(nK2, C7) for j ≥ 2 and n ≤ 6. Y. Rowshan et… Expand

#### References

SHOWING 1-10 OF 27 REFERENCES
The Multipartite Ramsey numbers $m_j(nK_2,C_7)$
Assume that Kj×n be a complete, multipartite graph consisting of j partite sets and n vertices in each partite set. For given graphs G1 and G2, the multipartite Ramsey number (MR-number) mj(G1, G2)Expand
Three-colour bipartite Ramsey number R_b(G_1, G_2, P_3)
• Physics, Computer Science
• Electron. J. Graph Theory Appl.
• 2020
This paper considers the three-colour bipartite Ramsey number R b ( G 1, G 2, P 3), and obtains the relations: R ( G, K 1, n ) ≤  R p ( G , K 1 , n +1 ) and R (G, H ) ≤ R b( G, H , P 3 ). Expand
Set and size multipartite Ramsey numbers for stars
• Computer Science, Mathematics
• Discret. Appl. Math.
• 2018
The size multipartite Ramsey number for stars, denoted by m c, is the smallest positive integer s such that any k -coloring of the edges of K c × s contains a monochromatic copy of K 1, n i in color i for some i, 1 ≤ i ≤ k . Expand
The Size, Multipartite Ramsey Numbers for nK2 Versus Path–Path and Cycle
• Mathematics
• 2021
For given graphs G1,G2,…,Gn and any integer j, the size of the multipartite Ramsey number mj(G1,G2,…,Gn) is the smallest positive integer t such that any n-coloring of the edges of Kj×t contains aExpand
On size multipartite Ramsey numbers for stars versus paths and cycles
• Computer Science, Mathematics
• Electron. J. Graph Theory Appl.
• 2017
The size tripartite Ramsey numbers of paths $P_n$ versus stars, with all $n\geq 2$ are investigated. Expand
The bipartite Ramsey numbers $BR(C_8, C_{2n})$
• Mathematics
• 2021
For given bipartite graphs G1, G2, . . . , Gt, the multicolor bipartite Ramsey number BR(G1, G2, . . . , Gt) is the smallest positive integer b such that any t-edge-coloring of Kb,b contains aExpand
Size multipartite Ramsey numbers for stripes versus small cycles
• Mathematics, Computer Science
• Electron. J. Graph Theory Appl.
• 2016
This paper obtains the exact values of the size Ramsey numbers $m_j(nK_2, C_m)$ for $j \ge 2$ and $m \in \{3,4,5,6\}$. Expand
On Size Multipartite Ramsey Numbers for Stars versus Cycles
• Computer Science
• ICGTIS
• 2015
The size multipartite Ramsey numbers mj ( G 1, G 2) is the smallest integer t such that every factorization of the graph Kj × t := F 1 ⊕ F 2 satisfies the following condition: either F 1 contains G 1 or F 2 contains G 2. Expand
A proof of a conjecture on Ramsey numbers $B(2,2,3)$
• Mathematics
• 2021
The bipartite Ramsey number B(n1, n2, . . . , nt) is the least positive integer b such that, any coloring of the edges of Kb,b with t colors will result in a monochromatic copy of Kni,ni in the i−thExpand
A multipartite Ramsey number for odd cycles
• F. Benevides
• Mathematics, Computer Science
• J. Graph Theory
• 2012
The main result is the proof that a conjecture of Gyarfas et al. (2009), holds for graphs with a large enough number of vertices, that if n⩾n0 is a positive odd integer then any two-coloring of the edges of the complete five-partite graph contains a monochromatic cycle of length n. Expand