English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The rainbow Tur\'an number $\mathrm{ex}^*(n,H)$ of a graph $H$ is the maximumpossible number of edges in a properly edge-coloured $n$-vertex graph with norainbow subgraph isomorphic to $H$. We prove that for any integer $k\geq 2$,$\mathrm{ex}^*(n,C_{2k})=O(n^{1+1/k})$. This is tight and establishes aconjecture of Keevash, Mubayi, Sudakov and Verstra\"ete. We use the same methodto prove several other conjectures in various topics. First, we prove thatthere exists a constant $c$ such that any properly edge-coloured $n$-vertexgraph with more than $cn(\log n)^4$ edges contains a rainbow cycle. It is knownthat there exist properly edge-coloured $n$-vertex graphs with $\Omega(n\logn)$ edges which do not contain any rainbow cycle. Secondly, we show that in anyproper 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, anda strenghtened version proposed by Xu, Zhang, Jing and Ge. Moreover, we answera question of Jiang and Newman by showing that there exists a constant $c=c(r)$such that any $n$-vertex graph with more than $cn^{2-1/r}(\log n)^{7/r}$ edgescontains the $r$-blowup of an even cycle. Finally, we prove that the $r$-blowupof $C_{2k}$ has Tur\'an 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.

Rainbow Tur\'an number of even cycles, repeated patterns and blow-ups of cycles