پديدآورندگان :
Rowshan Yaser y.rowshan@iasbs.ac.ir Department of Mathematics, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran , Gholami Mostaffa gholami.m@iasbs.ac.ir Department of Mathematics, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran
كليدواژه :
Ramsey numbers , Multipartite Ramsey numbers , Complete graphs , Mathings
چكيده فارسي :
Assume that Kj×n is a complete and multipartite graph consisting of j partite sets and n vertices in each partite set. For the 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 (H1, H2, . . . , Hn) of the edges of Kj×t, Hi contains a monochromatic copy of Gi for at least one i. In this article, we obtain some results in therm of M-R-number mj (Km, nK2) for j, n, m ≥ 2.
