  We prove that a family $\mathcal{T}$ of distinct triangles on $n$ given
vertices that does not have a rainbow triangle (that is, three edges, each
taken from a different triangle in $\mathcal{T}$, that form together a
triangle) must be of size at most $\frac{n^2}{8}$. We also show that this
result is sharp and characterize the extremal case. In addition, we discuss a
version of this problem in which the triangles are not necessarily distinct,
and show that in this case, the same bound holds asymptotically. After posting
the original arXiv version of this paper, we learned that the sharp upper bound
of $\frac{n^2}{8}$ was proved much earlier by Gy\H{o}ri (2006) and
independently by Frankl, F\"uredi and Simonyi (unpublished). Gy\H{o}ri also
obtained a stronger version of our result for the case when repetitions are
allowed.
