{
  "id": "2204.02732",
  "version": "v1",
  "published": "2022-04-06T11:16:00.000Z",
  "updated": "2022-04-06T11:16:00.000Z",
  "title": "Good point sequencings of Steiner triple systems",
  "authors": [
    "Grahame Erskine",
    "Terry Griggs"
  ],
  "comment": "9 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-04-06T11:16:00.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05B07"
    ],
    "keywords": [
      "steiner triple system",
      "point sequencings",
      "small order",
      "computational results",
      "permutation contains"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}