54 citations · 108 across the 24 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Decompositions of complete multigraphs into cycles of varying lengths
Darryn Bryant, Daniel Horsley, Barbara Maenhaut +1
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint…
math.CO2015
More nonexistence results for symmetric pair coverings
Nevena Francetić, Sarada Herke, Daniel Horsley
A -covering is a pair , where is a -set of points and is a collection of -subsets of (called blocks), such that every unorder…
cs.IT2015
Compressed sensing with combinatorial designs: theory and simulations
Darryn Bryant, Charles Colbourn, Daniel Horsley +1
In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use…