Aharoni's rainbow Caccetta–Häggkvist conjecture

Let $G$ be an $n$-vertex graph whose edges are colored with $n$ colors, and let the rainbow girth be the minimum length of a rainbow cycle, with value $\infty$ if no rainbow cycle exists. Assume that every color class has size at least $r$. Aharoni's rainbow Caccetta–Häggkvist conjecture. The rainbow girth of $G$ is at most

$$\left\lceil\frac{n}{r}\right\rceil.$$

This conjecture generalizes the Caccetta–Häggkvist conjecture to edge-colored graphs. The supplied text does not state whether it has been resolved; the surrounding paper studies sufficient conditions for logarithmic rainbow girth.