Daniel Horsley

collaborators

3 papers

math.CO2025

The semi-inducibility problem

Abdul Basit, Bertille Granet, Daniel Horsley +2

Let $H$ be a $k$ -edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$ -edge-coloured complete graph on $n$ vertices? This pape…

math.CO2024

Excess Coverage Arrays and Levenshtein's Conjecture

Amber E. Gentle, Daniel Horsley, Ian M. Wanless

A sequence covering array, denoted \textsf{SCA} $(N; t, v)$ , is a set of $N$ permutations of ${0, \dots, v - 1}$ such that each sequence of $t$ distinct elements of $\{0, \dots, v-1\…

math.CO2024

Completing partial $k$ -star designs

Ajani De Vas Gunasekara, Daniel Horsley

A $k$ -star is a complete bipartite graph $K_{1, k}$ . A partial $k$ -star design of order $n$ is a pair $(V, A)$ where $V$ is a set of $n$ vertices and $A$ is a set…

The semi-inducibility problem

Excess Coverage Arrays and Levenshtein's Conjecture

Completing partial k-star designs

Completing partial $k$ -star designs