A note on the relation between Hartnell’s firefighter problem and growth of groups

Abstract

The firefighter game problem on locally finite connected graphs was introduced by Bert Hartnell [6]. The game on a graph G can be described as follows: let f n be a sequence of positive integers; an initial fire starts at a finite set of vertices; at each (integer) time n≥1, f n vertices which are not on fire become protected, and then the fire spreads to all unprotected neighbors of vertices on fire; once a vertex is protected or is on fire, it remains so for all time intervals. The graph G has the f n -containment property if every initial fire admits an strategy that protects f n vertices at time n so that the set of vertices on fire is eventually constant. If the graph G has the containment property for a sequence of the form f n =Cn d , then the graph is said to have polynomial containment. In [5], it is shown that any locally finite graph with polynomial growth has polynomial containment; and it is remarked that the converse does not hold. That article also raised the question of whether the equivalence of polynomial growth and polynomial containment holds for Cayley graphs of finitely generated groups. In this short note, we remark how the equivalence holds for elementary amenable groups and for non-amenable groups from results in the literature.