15 citations · 18 across the 5 of their papers we have counts for
15 papers · 1 filter
Smaller embeddings of partial -star decompositions
Ajani De Vas Gunasekara, Daniel Horsley
A -star is a complete bipartite graph . For a graph , a -star decomposition of is a set of -stars in whose edge sets partition the edge set of . If…
Distributing hash families with few rows
Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley
Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for…
Disjoint spread systems and fault location
Charles J. Colbourn, Bingli Fan, Daniel Horsley
When factors each taking one of levels may affect the correctness or performance of a complex system, a test is selected by setting each factor to one of its levels and det…
More constructions for Sperner partition systems
Adam Gowty, Daniel Horsley
An -Sperner partition system is a set of partitions of some -set such that each partition has nonempty parts and no part in any partition is a subset of a part in a d…
Countable homogeneous Steiner triple systems avoiding specified subsystems
Daniel Horsley, Bridget S. Webb
In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"ıssé limits of classes of finite Steiner tri…
On determining when small embeddings of partial Steiner triple systems exist
Darryn Bryant, Ajani De Vas Gunasekara, Daniel Horsley
A partial Steiner triple system of order is a pair where is a set of elements and is a set of triples of elements of such that any t…