Block-avoiding point sequencings of arbitrary length in Steiner triple systems

Abstract

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).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…