2000 character limit reached
Block-avoiding point sequencings of arbitrary length in Steiner triple systems
Published 9 Jul 2019 in math.CO and cs.DM | (1907.04416v1)
Abstract: An $\ell$-good sequencing of an STS$(v)$ is a permutation of the points of the design such that no $\ell$ consecutive points in this permutation contain a block of the design. We prove that, for every integer $\ell \geq 3$, there is an $\ell$-good sequencing of any STS$(v)$ provided that $v$ is sufficiently large. We also prove some new nonexistence results for $\ell$-good sequencings of STS$(v)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.