3 papers
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.CO2024
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…
math.CO2024
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…