On some Ramsey and Turán-type numbers for paths and cycles (Q2500974)

Summary: For given graphs \(G_{1}, G_{2}, \dots , G_{k}\), where \(k \geq 2\), the multicolor Ramsey number \(R(G_{1}, G_{2}, \dots , G_{k})\) is the smallest integer \(n\) such that if we arbitrarily color the edges of the complete graph on \(n\) vertices with \(k\) colors, there is always a monochromatic copy of \(G_{i}\) colored with \(i\), for some \(1 \leq i \leq k\). Let \(P_k\) (resp. \(C_k\)) be the path (resp. cycle) on \(k\) vertices. In the paper we show that \(R(P_3,C_k,C_k)=R(C_k,C_k)=2k-1\) for odd \(k\). In addition, we provide the exact values for Ramsey numbers \(R(P_{4}, P_{4}, C_{k})=k+2\) and \(R(P_{3}, P_{5}, C_{k})=k+1\).