For the graphs G1, G2, and G, if every 2-coloring (red and blue) of the edges of G results in either a copy of blueG1 or a copy of redG2, we write G → (G1, G2). The size Ramsey number R^(G1,G2) is the smallest number e such that there is a graph G with size e satisfying G → (G1, G2), i.e., R^(G1,G2)=min{|E(G)|:G→(G1,G2)}. In this paper, by developing the procedure and algorithm, we determine exact values of the size Ramsey numbers of some paths and cycles. More precisely, we obtain that R^(C4,C5)=19, R^(C6,C6)=26, R^(P4,C5)=14, R^(P4,P5)=10, R^(P4,P6)=14, R^(P5,P5)=11, R^(P3,P5)=7 and R^(P3,P6)=8.
中文翻译:
某些大小的Ramsey数的路径和循环的精确值
对于图 G1,G2和G,如果每2种颜色(红 和 蓝色)的边缘 G 结果是 蓝色G1或副本红G2,我们写G →(G1,G2)。大小拉姆齐数[R^(G1个,G2) 是最小的数字 Ë 这样有一个图 G 与大小 Ë 满意的 G →(G1,G2),即[R^(G1个,G2)=分{|Ë(G)|:G→(G1个,G2)}。在本文中,通过开发过程和算法,我们确定了某些路径和循环的大小Ramsey数的精确值。更准确地说,我们得到[R^(C4,C5)=19, [R^(C6,C6)=26, [R^(P4,C5)=14, [R^(P4,P5)=10, [R^(P4,P6)=14, [R^(P5,P5)=11, [R^(P3,P5)=7 和 [R^(P3,P6)=8。