Grahame Erskine, Terry Griggs
Published 2022-04-06Version 1
An l-good sequencing of a Steiner triple system of order v, STS(v), is a permutation of the points of the system such that no l consecutive points in the permutation contains a block. It is known that every STS(v) with v > 3 has a 3-good sequencing. It is proved that every STS(v) with v >= 13 has a 4-good sequencing and every 3-chromatic STS(v) with v >= 15 has a 5-good sequencing. Computational results for Steiner triple systems of small order are also given.
Cycle switching in Steiner triple systems of order 19
On the upper embedding of Steiner triple systems and Latin squares
The combinatorial game nofil played on Steiner Triple Systems
![QR code for arXiv:2204.02732 [math.CO]](http://oss.arxitics.com/images/favicon.svg)