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 2017Show all

2 papers · 1 filter

math.CO2017

New lower bounds for $t$ -coverings

Daniel Horsley, Rakhi Singh

Fisher proved in 1940 that any $2$ - $(v, k, λ)$ design with $v > k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$ - $(v, k, λ)$ …

math.CO2017★ 8 cited

Steiner triple systems with high chromatic index

Darryn Bryant, Charles Colbourn, Daniel Horsley +1

It is conjectured that every Steiner triple system of order $v \neq = 7$ has chromatic index at most $(v + 3) /2$ when $v \equiv 3 (mod 6)$ and at most $(v + 5) /2$ when $v \equiv 1 \pmod…

New lower bounds for t-coverings

Steiner triple systems with high chromatic index

New lower bounds for $t$ -coverings