Almost all Steiner triple systems are almost resolvable

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).

Keywords

• 35P15
• 58C40
• 53A07
• survey design
• measurement error
• machine learning