Almost all Steiner triple systems are almost resolvable
arXiv:1907.06744 · doi:10.1017/fms.2020.29
Abstract
We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).