Premium
Existence of non‐resolvable Steiner triple systems
Author(s) -
Ching Li Ben Pak,
van Rees G. H. J.
Publication year - 2005
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20027
Subject(s) - mathematics , combinatorics , steiner system , discrete mathematics
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(2 v + 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom