1 problem

Let $C_{2k}$ denote the cycle of length $2k$, and let $\mathrm{ex}^*(n,H)$ be the maximum number of edges in a properly edge-coloured $n$-vertex graph containing no rainbow copy of…