The-proper-Ramsey-numbers-of-\(K_3\)-against-\(C_3\)-and-\(C_5\) (Q6558936)

Let \(\chi^\prime (G)\) denote the chromatic index of a graph \(G\). For two graphs \(F\) and \(H\), the proper Ramsey number \(\mathrm{PR}(F,H)\) of \(F\) and \(H\) is defined to be the smallest positive integer \(n\) such that every \(\chi^\prime (H)\)-edge coloring of the complete graph \(K_n\) contains either a monochromatic \(F\) or a properly colored \(H\). If \(\mathrm{PR}(F,H)=n\), it is clear that there exists at least one coloring of \(K_{n-1}\) which contains neither. Such a coloring is called a critical coloring with respect to \(\mathrm{PR}(F,H)\).\N\N\textit{S. English} et al. [ibid. 101, 281--299 (2017; Zbl 1371.05079)] determined \(\mathrm{PR}(F,H)\) for a variety of a graph in which \(\chi^\prime (H)=2\), including \(\mathrm{PR}(K_3, C_4)\). Later \textit{D. Olejniczak} [Variations in Ramsey theory. Kalamazoo, MI: Western Michigan University (PhD Thesis) (2019)] found the values of \(\mathrm{PR}(K_3, C_n)\) when \(n\) is even.\N\NIn this article under review, the authors prove that \(\mathrm{PR}(K_3, C_3)=11\) and \(\mathrm{PR}(K_3, C_5)=7\).