Barrus–Ferrara–Vandenbussche–Wenger conjecture on rainbow clique saturation

Let $K_k$ be the complete graph on $k$ vertices, let $\mathcal{R}(K_k)$ be the family of rainbow edge-colorings of $K_k$, and let $\operatorname{sat}_t(n,\mathcal{R}(K_k))$ denote the minimum number of edges in an $n$-vertex graph that is $(\mathcal{R}(K_k),t)$-saturated. Barrus–Ferrara–Vandenbussche–Wenger conjecture. For $k\ge 3$ and $t\ge {k\choose 2}$,

$$\operatorname{sat}_t(n,\mathcal{R}(K_k))=\Theta(n\log n).$$

This refines known bounds of order between $n\log(n)/\log\log(n)$ and $n\log(n)$ for rainbow clique saturation, and the stated asymptotic equality remains unresolved in the supplied source.