Abstract
Abstract For given two graphs G 1 and G 2, and integer j ≥ 2, 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. In this paper, we determine mj ( S m , Cn ) for j , m , n ≥ 3 where S m is a star on m vertices and Cn is a cycle on n vertices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
