Title of article
Size multipartite Ramsey numbers for stripes versus small cycles
Author/Authors
jayawardene, chula university of colombo - department of mathematics, Sri Lanka , baskoro, edy tri institut teknologi bandung - faculty of mathematics and natural sciences - combinatorial mathematics research group, Indonesia , samarasekara, lilanthi university of colombo - department of mathematics, Sri Lanka , sy, syafrizal universitas andalas, Indonesia
From page
157
To page
170
Abstract
For simple graphs G1 and G2, the size Ramsey multipartite number mj(G1;G2) is defined as the smallest natural number s such that any arbitrary two coloring of the graph K_j*s using the colors red and blue, contains a red G1 or a blue G2 as subgraphs. In this paper, we obtain the exact values of the size Ramsey numbers mj(nK2;Cm) for j ≥ 2 and m є{3; 4; 5; 6}.
Keywords
Graph theory , Ramsey Theory
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Record number
2553705
Link To Document