Fire Containment in Planar Graphs

Details Fire Containment in Planar Graphs Fire Containment in Planar Graphs

2011-02-15

arxiv.org/abs/1102.3016v3

Mathematics

Combinatorics

15 pages, minor corrections

Scientific paper

In a graph $G$, a fire starts at some vertex. At every time step, firefighters can protect up to $k$ vertices, and then the fire spreads to all unprotected neighbours. The $k$-surviving rate $\rho_k(G)$ of $G$ is the expectation of the proportion of vertices that can be saved from the fire, if the starting vertex of the fire is chosen uniformly at random. For a given class of graphs $\cG$ we are interested in the minimum value $k$ such that $\rho_k(G)\ge\epsilon$ for some constant $\epsilon>0$ and all $G\in\cG$ i.e., such that linearly many vertices are expected to be saved in every graph from $\cG$). In this note, we prove that for planar graphs this minimum value is at most 4, and that it is precisely 2 for triangle-free planar graphs.

Affiliated with

Also associated with

No associations

Rating

Fire Containment in Planar Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fire Containment in Planar Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fire Containment in Planar Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378172