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

4 papers · 1 filter

math.CO2019

The cyclic matching sequenceability of regular graphs

Daniel Horsley, Adam Mammoliti

The cyclic matching sequenceability of a simple graph $G$ , denoted $cms (G)$ , is the largest integer $s$ for which there exists a cyclic ordering of the edges of $G$ so tha…

math.CO2019

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 $u$ is a pair $(U, A)$ where $U$ is a set of $u$ elements and $A$ is a set of triples of elements of $U$ such that any t…

math.CO2019

Generating infinite digraphs by derangements

Daniel Horsley, Moharram Iradmusa, Cheryl E. Praeger

A set $S$ of derangements (fixed-point-free permutations) of a set $V$ generates a digraph with vertex set $V$ and arcs $(x, x^{σ})$ for $x \in V$ and $σ \in S$ . We a…

math.CO2019

On the minimum degree required for a triangle decomposition

Peter J. Dukes, Daniel Horsley

We prove that, for sufficiently large $n$ , every graph of order $n$ with minimum degree at least $0.852 n$ has a fractional edge-decomposition into triangles. We do this by refining…