I want to create STS(n) algorithmically. I know there are STS(n)s for $n \cong 1,3 \mod 6$. But it is difficult to actually construct the triples. For STS(7) it is pretty easy and but for larger n I end up using trial and error. Is there a general algorithm that can be used?
2 of 2
added top level tag and another more specific tag (given that question was buped to the front page)
Ricardo Andrade
- 6.2k
- 5
- 42
- 69
Constructing Steiner Triple Systems Algorithmically
JarvisP
- 133
- 1
- 4