Almost all Steiner triple systems are almost resolvable
Combinatorics
2020-11-04 v2
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).
Cite
@article{arxiv.1907.06744,
title = {Almost all Steiner triple systems are almost resolvable},
author = {Asaf Ferber and Matthew Kwan},
journal= {arXiv preprint arXiv:1907.06744},
year = {2020}
}