Document Type

Article

Publication Date

2019

Department

Department of Mathematical Sciences

Abstract

Given an STS(v), we ask if there is a permutation of the points of the design such that no l consecutive points in this permutation contain a block of the design. Such a permutation is called an l-good sequenc-ing. We prove that 3-good sequencings exist for any STS(v) with v>3 and 4-good sequencings exist for any STS(v) with v>71. Similar re-sults also hold for partial STS(v). Finally, we determine the existence or nonexistence of 4-good sequencings for all the nonisomorphic STS(v) with v =7, 9, 13 and 15.

Publisher's Statement

© The author(s). Released under the CC BY-ND 4.0 International License. Publisher’s version of record: http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p498.pdf

Publication Title

AUSTRALASIAN JOURNAL OF COMBINATORICS

Creative Commons License

Creative Commons Attribution-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-No Derivative Works 4.0 License.

Version

Publisher's PDF

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.