2 citations · 2 across the 7 of their papers we have counts for
4 papers · 2 filters
Proportion-Based Hypergraph Burning
Andrea C. Burgess, John A. Hawkin, Alexander J. M. Howse +2
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently…
Existential Closure in Uniform Hypergraphs
Andrea C. Burgess, Robert D. Luther, David A. Pike
For a positive integer , a graph with at least vertices is -existentially closed or simply -e.c. if for any set of vertices of size and any set ,…
Weak colourings of Kirkman triple systems
Andrea C. Burgess, Nicholas J. Cavenagh, Peter Danziger +1
A -colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} of a block design is the smallest in…
Extending Graph Burning to Hypergraphs
Andrea C. Burgess, Caleb W. Jones, David A. Pike
Graph burning is a round-based game or process that discretely models the spread of influence throughout a network. We introduce a generalization of graph burning which applies to…