Daniel Horsley

activity

20122022

most citedDecompositions of complete graphs into cycles of arbitrary lengths

54 citations · 108 across the 24 of their papers we have counts for

collaborators

Showing 2021Show all

4 papers · 1 filter

math.CO2021

Block avoiding point sequencings of partial Steiner systems

Daniel Horsley, Padraig Ó Catháin

A partial $(n, k, t)_{λ}$ -system is a pair $(X, B)$ where $X$ is an $n$ -set of vertices and $B$ is a collection of $k$ -subsets of $X$ called blocks such that each $t…

math.CO2021

Smaller embeddings of partial $k$ -star decompositions

Ajani De Vas Gunasekara, Daniel Horsley

A $k$ -star is a complete bipartite graph $K_{1, k}$ . For a graph $G$ , a $k$ -star decomposition of $G$ is a set of $k$ -stars in $G$ whose edge sets partition the edge set of $G$ . If…

math.CO2021★ 3 cited

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…

math.CO2021★ 15 cited

Disjoint spread systems and fault location

Charles J. Colbourn, Bingli Fan, Daniel Horsley

When $k$ factors each taking one of $v$ 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…

Block avoiding point sequencings of partial Steiner systems

Smaller embeddings of partial k-star decompositions

Distributing hash families with few rows

Disjoint spread systems and fault location

Smaller embeddings of partial $k$ -star decompositions