David A. Pike

activity

20242026

most citedExtending Graph Burning to Hypergraphs

2 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Burning Steiner triple systems

Andrea C. Burgess, Peter H. Danziger, Caleb W. Jones +2

Graph burning is a round-based process which can be viewed as a discrete one-player game that models the spread of influence throughout a network. Extending this process to hypergr…

math.CO2026

Locally Semi-Equitable Colourings of BIBDs

Andrea C. Burgess, William Kellough, David A. Pike

We study $ℓ$ -colourings of $(v, k, λ)$ -BIBDs (balanced incomplete block designs) where, within each block, one colour is absent and each of the $ℓ - 1$ other colours appears exac…

math.CO2026

Uniquely 2-colourable 4-cycle decompositions

Andrea C. Burgess, David A. Pike, Shahriyar Pourakbar-Saffar

A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_{n}$ into cycles of a fixed length. A cycle system is said to be $k$ -colourable if we can assign…