The firefighter number conjecture for planar graphs of girth at least 5

Let P5\mathcal{P}_5 be the class of planar graphs of girth at least 55, and let ff(P5)\mathit{ff}(\mathcal{P}_5) denote its firefighter number. Firefighter number conjecture for planar graphs of girth at least 5.

ff(P5)=1.\mathit{ff}(\mathcal{P}_5)=1.

The paper explains that this would be stronger than the known result ff(P9)=1\mathit{ff}(\mathcal{P}_9)=1 and suggests adapting its proof techniques to the girth-55 case, but the conjecture remains open.

Sources & referencesView supporting material

Primary source

Louis Esperet, Jan van den Heuvel, Frédéric Maffray and Félix Sipma, “Fire Containment in Planar Graphs”, arXiv:1102.3016 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.