Minimum-degree conditions for rainbow triangles

Let $G≔(G_1,G_2,G_3)$ be a triple of graphs on a common vertex set $V$ of size $n$. A rainbow triangle in $G$ is a triple of edges $\left(e_1,e_2,e_3\right)$ with $e_i\in G_i$ for each $i$ and $\left\{e_1,e_2,e_3\right\}$ forming a triangle in $V$. In this paper we consider the following question: what triples of minimum-degree conditions $\left(\delta \left(G_1\right),\delta \left(G_2\right),\delta \left(G_3\right)\right)$ guarantee the existence of a rainbow triangle? This may be seen as a minimum-degree version of a problem of Aharoni, DeVos, de la Maza, Montejano and Šámal on density conditions for rainbow triangles, which was recently resolved by the authors. We establish that the extremal behaviour in the minimum-degree setting differs strikingly from that seen in the density setting, with discrete jumps as opposed to continuous transitions. Our work leaves a number of natural questions open, which we discuss.