论文信息 - Existence of non‐resolvable Steiner triple systems

Existence of non‐resolvable Steiner triple systems

We consider two well-known constructions for Steiner triple systems. The first construction is recursive and uses an STS(v) to produce a non-resolvable STS(2v + 1), for v ≡ 1 (mod 6). The other construction is the Wilson construction that we specify to give a non-resolvable STS(v), for v ≡ 3 (mod 6), v > 9. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 16–24, 2005.

Pak Ching Li | G. H. J. van Rees

[1] D. K. Ray-Chaudhuri,et al. Solution of Kirkman''s schoolgirl problem , 1971 .

[2] Prince Camille de Polignac. On a Problem in Combinations , 1866 .

[3] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[4] Richard M. Wilson. Some partitions of all triples into steiner triple systems , 1974 .