3/2 Firefighters are not enough

The firefighter problem is a monotone dynamic process in graphs that can be viewed as modeling the use of a limited supply of vaccinations to stop the spread of an epidemic. In more detail, a fire spreads through a graph, from burning vertices to their unprotected neighbors. In every round, a small amount of unburnt vertices can be protected by firefighters. How many firefighters per turn, on average, are needed to stop the fire from advancing? We prove tight lower and upper bounds on the amount of firefighters needed to control a fire in the Cartesian planar grid and in the strong planar grid, resolving two conjectures of Ng and Raff.

[1]  Gary MacGillivray,et al.  The firefighter problem for graphs of maximum degree three , 2007, Discret. Math..

[2]  Wang Weifan.  On the firefighter problem of Halin graphs , 2011 .

[3]  Peter Gacs.  The angel wins , 2007 .

[4]  Bert Hartnell,et al.  On designing a network to defend against random attacks of radius two , 1989, Networks.

[5]  Margaret-Ellen Messinger,et al.  FIREFIGHTING ON THE STRONG GRID , 2007 .

[6]  Gary MacGillivray,et al.  AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 43 (2009), Pages 57–77 The Firefighter Problem: A survey of results, directions and questions , 2022 .

[7]  Brian H. Bowditch,et al.  The Angel Game in the Plane , 2007, Combinatorics, Probability and Computing.

[8]  Oddvar Kloster,et al.  A solution to the Angel Problem , 2007, Theor. Comput. Sci..

[9]  Gary MacGillivray,et al.  The firefighter problem for cubic graphs , 2010, Discret. Math..

[10]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[11]  Martin Kutz,et al.  The Angel Problem, Positional Games, and Digraph Roots , 2004 .

[12]  Stephen G. Hartke,et al.  Fire containment in grids of dimension three and higher , 2007, Discret. Appl. Math..

[13]  András Máthé,et al.  The Angel of Power 2 Wins , 2007, Combinatorics, Probability and Computing.

[14]  Margaret-Ellen Messinger,et al.  Average firefighting on infinite grids , 2008, Australas. J Comb..

[15]  K. L. Ng,et al.  A generalization of the firefighter problem on Z×Z , 2008, Discret. Appl. Math..

[16]  Doron Zeilberger,et al.  Automated discovery and proof in three combinatorial problems , 2009 .