Ferber–Kwan resolvability conjecture for random Steiner triple systems

Let a Steiner triple system of order $n$ be a $3$-uniform hypergraph on $n$ vertices in which every pair lies in exactly one edge, and let a perfect matching be a set of $n/3$ pairwise disjoint triples. Ferber–Kwan conjecture. A random Steiner triple system of order $n\equiv 3\;\mathrm{mod}\;6$ has a decomposition into perfect matchings with high probability. Such a decomposition is equivalent to resolvability, and previous work established many disjoint perfect matchings with high probability.