Block avoiding point sequencings of partial Steiner systems (Q2673985): Difference between revisions

A partial \((n, k, t)_\lambda\)-system is a pair\((X, \mathcal{B})\) where \(X\) is an \(n\)-set of vertices and \(\mathcal{B}\) is a collection of \(k\)-subsets of \(X\) called blocks such that each \(t\)-set of vertices is a subset of at most \(\lambda\) blocks. A sequencing of such a system is a labelling of its vertices with distinct elements of \(\{0,\ldots, n-1\}\). A sequencing is \(\ell\)-good if no block is contained in a set of \(\ell\) vertices with consecutive labels. In the paper, some new results are presented: when \(n\) became large and when the parameters \(k\), \(t\), \(\lambda\) and \(\ell\) satisfied certain conditions, any partial \((n, k, t)_\lambda\)-system has an \(\ell\)-good sequencing. So, the results of \textit{S. R. Blackburn} and \textit{T. Etzion} [``Block-avoiding point sequencings'', J. Comb. Des. 29, No. 6, 339--366 (2021; \url{doi:10.1002/jcd.21770})] are improved as well as those of \textit{D. R. Stinson} and \textit{S. Veitch} [Australas. J. Comb. 77, Part 1, 87--99 (2020; Zbl 1444.05026)]. As an application, when some parameters took special values, this paper also got some concrete examples, which are shown in the form of corollaries.