Burning the plane: densities of the infinite Cartesian grid
Burning the plane: densities of the infinite Cartesian grid
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the underlying graph is also changing at each time-step. The main focus is on the …