Given a graph F and a positive integer r,the size Ramsey number R(F,r)is defined as the smallest integer m such that there exists a graph G with m edges where every r-color edge coloring of G results in a monochromati...Given a graph F and a positive integer r,the size Ramsey number R(F,r)is defined as the smallest integer m such that there exists a graph G with m edges where every r-color edge coloring of G results in a monochromatic copy of F.Let P_(n)and C_(n)represent a path and a cycle on n vertices,respectively.In this paper,we establish that for sufficiently large n,R(P_(n),P_(n),P_(n))<772n.Furthermore,we demonstrate that for sufficiently large even integers n,R(P_(n),P_(n),C_(n))≤17093n.For sufficiently large odd integer n,we show that R(P_(n),P_(n),C_(n))≥(7.5-o(1))n.展开更多
基金Supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China(Grant No.24KJD110008)the National Natural Science Foundation of China(Grant No.12401469)。
文摘Given a graph F and a positive integer r,the size Ramsey number R(F,r)is defined as the smallest integer m such that there exists a graph G with m edges where every r-color edge coloring of G results in a monochromatic copy of F.Let P_(n)and C_(n)represent a path and a cycle on n vertices,respectively.In this paper,we establish that for sufficiently large n,R(P_(n),P_(n),P_(n))<772n.Furthermore,we demonstrate that for sufficiently large even integers n,R(P_(n),P_(n),C_(n))≤17093n.For sufficiently large odd integer n,we show that R(P_(n),P_(n),C_(n))≥(7.5-o(1))n.
