English

Nonsequenceable Steiner triple systems

Combinatorics 2019-03-22 v1

Abstract

A partial Steiner triple system is is sequenceablesequenceable if the points can be sequenced so that no proper segment can be partitioned into blocks. We show that, if 0a(n1)/30 \leq a \leq (n-1)/3, then there exists a nonsequenceable PSTS(n)(n) of size 13(n2)a\frac{1}{3}\binom{n}{2}-a, for all n1(mod6)n \equiv 1 \pmod{6} except for n=7n=7.

Keywords

Cite

@article{arxiv.1903.08719,
  title  = {Nonsequenceable Steiner triple systems},
  author = {Donald L. Kreher and Douglas R. Stinson},
  journal= {arXiv preprint arXiv:1903.08719},
  year   = {2019}
}
R2 v1 2026-06-23T08:14:23.907Z