2 research outputs found
On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles
Let be a complete, balanced, multipartite graph consisting of partite sets and vertices in each partite set. For given two graphs and , and integer , the size multipartite Ramsey number is the smallest integer such that every factorization of the graph satisfies the following condition: either contains or contains . In 2007, Syafrizal et al. determined the size multipartite Ramsey numbers of paths versus stars, for only. Furthermore, Surahmat et al. (2014) gave the size tripartite Ramsey numbers of paths versus stars, for . In this paper, we investigate the size tripartite Ramsey numbers of paths versus stars, with all . Our results complete the previous results given by Syafrizal et al. and Surahmat et al. We also determine the size bipartite Ramsey numbers of stars versus cycles, for