1 problem

Let $G_1,G_2,G_3\subset\binom{[n]}{2}$ be simple graphs whose edge-colored multiple graph is rainbow triangle-free, meaning that it contains no triangle whose three edges have dist…