Rainbow-spanning-tree game threshold conjecture

Let $\mathcal{RS}_n$ be the rainbow-spanning-tree game played on $n-1$ copies of $K_n$, where Maker wins by claiming a rainbow spanning tree, and let $b_{\mathcal{RS}_n}$ denote its threshold bias. Rainbow-spanning-tree threshold conjecture.

$$b_{\mathcal{RS}_n}=(1+o(1))\frac{n^2}{\log(n)}.$$

The paper proves matching order bounds, with a lower-bound constant $\log(2)/8$ and an upper bound of $(1+o(1))n^2/\log(n)$; the conjecture asserts that the upper bound is asymptotically tight.