The firefighter problem on polynomial and intermediate growth groups
From MaRDI portal
Abstract: We prove that any Cayley graph with degree polynomial growth does not satisfy -containment for any . This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that firefighters are enough, answering and strengthening a conjecture of Develin and Hartke. We also prove that intermediate growth Cayley graphs do not satisfy polynomial containment, and give explicit lower bounds depending on the growth rate of the group. These bounds can be further improved when more geometric information is available, such as for Grigorchuk's group.
Recommendations
- A note on the relation between Hartnell’s firefighter problem and growth of groups
- Fire retainment on Cayley graphs
- The coarse geometry of Hartnell's firefighter problem on infinite graphs
- Firefighting on trees and Cayley graphs
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
Cites work
Cited in
(7)- Fire retainment on Cayley graphs
- Surviving rate of graphs and firefighter problem
- Multi-layered planar firefighting
- Coarse geometry of the fire retaining property and group splittings
- The coarse geometry of Hartnell's firefighter problem on infinite graphs
- The branching number of intermediate growth trees
- The lamplighter groups have infinite weak cop number
This page was built for publication: The firefighter problem on polynomial and intermediate growth groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198398)