Block-avoiding point sequencings of arbitrary length in Steiner triple systems
share
An ℓ-good sequencing of an STS(v) is a permutation of the points of the design such that no ℓ consecutive points in this permutation contain a block of the design. We prove that, for every integer ℓ≥ 3, there is an ℓ-good sequencing of any STS(v) provided that v is sufficiently large. We also prove some new nonexistence results for ℓ-good sequencings of STS(v).
READ FULL TEXT
