Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles

Abstract

The rainbow Turán number ${\mathrm{ex}}^{\ast }(n,H)$ of a graph $H$ is the maximum possible number of edges in a properly edge-coloured $n$-vertex graph with no rainbow subgraph isomorphic to $H$. We prove that for any integer $k\ge 2$, ${\mathrm{ex}}^{\ast }(n,C_{2k})=O(n^{1+1/k})$. This is tight and establishes a conjecture of Keevash, Mubayi, Sudakov and Verstraëte. We use the same method to prove several other conjectures in various topics. First, we prove that there exists a constant $c$ such that any properly edge-coloured $n$-vertex graph with more than $cn(\log n{)}^4$ edges contains a rainbow cycle. It is known that there exist properly edge-coloured $n$-vertex graphs with $\Omega (n\log n)$ edges which do not contain any rainbow cycle. Secondly, we show that in any proper edge-colouring of $K_n$ with $o(n^{\frac{r}{r-1}\cdot \frac{k-1}{k}})$ colours, there exist $r$ colour-isomorphic, pairwise vertex-disjoint copies of $C_{2k}$. This proves in a strong form a conjecture of Conlon and Tyomkyn, and a strenghtened version proposed by Xu, Zhang, Jing and Ge. Moreover, we answer a question of Jiang and Newman by showing that there exists a constant $c=c(r)$ such that any $n$-vertex graph with more than $c{n}^{2-1/r}(\log n{)}^{7/r}$ edges contains the $r$-blowup of an even cycle. Finally, we prove that the $r$-blowup of $C_{2k}$ has Turán number $O(n^{2-\frac{1}{r}+\frac{1}{k+r-1}+o(1)})$, which can be used to disprove an old conjecture of Erd\H os and Simonovits.

18 pages; proof reorganized and simplified