1 problem

Let $P_k$ denote a path on $k$ vertices, and let $\operatorname{ex}^{*}(n,P_k)$ be the maximum number of edges in a properly edge-colored $n$-vertex graph containing no rainbow cop…