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

Let $\mathbf{G}:=(G_1, G_2, G_3)$ be a triple of graphs on the same vertexset $V$ of size $n$. A rainbow triangle in $\mathbf{G}$ is a triple of edges$(e_1, e_2, e_3)$ with $e_i\in G_i$ for each $i$ and $\{e_1, e_2, e_3\}$forming a triangle in $V$. The triples $\mathbf{G}$ not containing rainbowtriangles, also known as Gallai colouring templates, are a widely studied classof objects in extremal combinatorics.  In the present work, we fully determine the set of edge densities $(\alpha_1,\alpha_2, \alpha_3)$ such that if $\vert E(G_i)\vert> \alpha_i n^2$ for each$i$ and $n$ is sufficiently large, then $\mathbf{G}$ must contain a rainbowtriangle. This resolves a problem raised by Aharoni, DeVos, de la Maza,Montejanos and \v{S}\'amal, generalises several previous results on extremalGallai colouring templates, and proves a recent conjecture of Frankl, Gy\"ori,He, Lv, Salia, Tompkins, Varga and Zhu.

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates