Constrained Ramsey numbers for rainbow $P_5$

Xihe Li, Xiangxiang Liu

Given a graph $H$ and a positive integer $k$, the {\it $k$-colored Ramsey number} $R_k(H)$ is the minimum integer $n$ such that in every $k$-edge-coloring of the complete graph $K_…