Erdős' high-girth Steiner triple system conjecture

A $(j,i)$-configuration in a family of sets is a collection of $i$ members spanning at most $j$ ground-set elements; the girth of a triangle packing is the smallest $i\geq 2$ for which it contains an $(i+2,i)$-configuration. Erdős' conjecture. For every integer $g\geq 3$, every sufficiently large $K_3$-divisible complete graph admits a $K_3$-decomposition with girth at least $g$. The source states that Kwan, Sah, Sawhney, and Simkin proved this conjecture in full, so it is solved.