most citedBlock-avoiding point sequencings of arbitrary length in Steiner triple systems

2 citations · 2 across the 2 of their papers we have counts for

collaborators

6 papers

math.CO2019

Block-avoiding point sequencings of Mendelsohn triple systems

Donald L. Kreher, Douglas R. Stinson, Shannon Veitch

A cyclic ordering of the points in a Mendelsohn triple system of order (or MTS) is called a sequencing. A sequencing is -good if there does not exist a triple $(…

math.CO2019

Good sequencings for small Mendelsohn triple systems

Donald L. Kreher, Douglas R. Stinson, Shannon Veitch

A Mendelsohn triple system of order (or MTS) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges , and…

math.CO2019

Block-avoiding point sequencings of directed triple systems

Donald L. Kreher, Douglas R. Stinson, Shannon Veitch

A directed triple system of order (or, DTS) is decomposition of the complete directed graph into transitive triples. A -good sequencing of a DTS is a p…

math.CO20192 cited

Block-avoiding point sequencings of arbitrary length in Steiner triple systems

Douglas R. Stinson, Shannon Veitch

An -good sequencing of an STS is a permutation of the points of the design such that no consecutive points in this permutation contain a block of the design. We p…

math.CO2019

Good sequencings for small directed triple systems

Donald L. Kreher, Douglas R. Stinson, Shannon Veitch

A directed triple system of order (or, DTS) is a decomposition of the complete directed graph into transitive triples. An -good sequencing of a DTS

math.CO2018

Constructions of optimal orthogonal arrays with repeated rows

Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch

We construct orthogonal arrays OA (of strength two) having a row that is repeated times, where is as large as possible. In particular, we consider OAs where the r…