Journal of Combinatorial Theory, Series AVolume 26, Issue 3, May 1979, Pages 298-303Further cases of double resolvabilityAuthor links open overlay panelR.H.F. DennistonShow moreShareCitehttps://doi.org/10.1016/0097-3165(79)90106-7Get rights and contentUnder an Elsevier user licenseopen archiveAbstractIf m is 5 or 25 or 43, and n ⩾ 1, the set of all combinations of 3nm things three at a time can be partitioned into resolvable Steiner triple systems.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1979 Published by Elsevier Inc.