Firefighting on trees and Cayley graphs
From MaRDI portal
Publication:5206909
zbMATH Open1429.05090arXiv1707.01224MaRDI QIDQ5206909FDOQ5206909
Authors: Florian Lehner 
Publication date: 19 December 2019
Abstract: We study Hartnell's firefighter problem on infinite trees and characterise the branching number in terms of the firefighting game. Using our results about trees, we give a partial answer to a question of Mart'inez-Pedroza concerning firefighting on Cayley graphs.
Full work available at URL: https://arxiv.org/abs/1707.01224
Recommendations
- Fire retainment on Cayley graphs
- Firefighting on trees beyond integrality gaps
- Firefighting on trees beyond integrality gaps
- The firefighter problem on graph classes
- On the sizes of burnt and fireproof components for fires on a large Cayley tree
- Firefighting on a random geometric graph
- Fighting constrained fires in graphs
- Fire Containment in Planar Graphs
- Firefighting on geometric graphs with density bounds.
- The firefighter problem for cubic graphs
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- The Firefighter problem: a survey of results, directions and questions
- Title not available (Why is that?)
- Random walks and percolation on trees
- Title not available (Why is that?)
- Fire containment in grids of dimension three and higher
- Firefighting on the triangular grid
- The coarse geometry of Hartnell's firefighter problem on infinite graphs
- A note on the relation between Hartnell’s firefighter problem and growth of groups
Cited In (6)
This page was built for publication: Firefighting on trees and Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206909)
