Year: 2026
Type: article
Abstract: 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 extended to apply to hypergraphs in both round-based and lazy settings. We introduce a variant of hypergraph burning that uses an alternative propagation rule for how the fire spreads – if some fixed proportion of vertices are on fire in a hyperedge, then in the next round, the entire hyperedge catches fire. We obtain bounds on the burning numbers of general hypergraphs, and introduce the concept of the burning distribution , which describes how the burning numbers change as the proportion parameter ranges over $(0,1)$ . We also obtain computational results which suggest there is a strong correlation between the automorphism group order and the lazy burning number of a balanced incomplete block design.
Source: Canadian Journal of Mathematics
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,550
OpenAlex ID: W7140191354
FWCI:
Cites:
Cited by:
Related to: