Extremal Results for Graphs Avoiding a Rainbow Subgraph

We say that k graphs G1, G2, ... , Gk on a common vertex set of size n contain a rainbow copy of a graph H if their union contains a copy of H with each edge belonging to a distinct Gi. We provide a counterexample to a conjecture of Frankl on the maximum product of the sizes of the edge sets of three graphs avoiding a rainbow triangle. We propose an alternative conjecture, which we prove under the additional assumption that the union of the three graphs is complete. Furthermore, we determine the maximum product of the sizes of the edge sets of three graphs or four graphs avoiding a rainbow path of length three.