Develin–Hartke conjecture on subcritical containment in square grids
Develin–Hartke conjecture on subcritical containment in square grids
Let be a positive integer, let denote the -dimensional square grid, and let satisfy
as tends to infinity. An outbreak is a fire spreading through the vertices of , and deploying firefighters at time means that at most that many vertices can be protected at that time.
Develin–Hartke conjecture. There exists an outbreak on that cannot be contained by deploying firefighters at time .
The claim predicts that any deployment rate asymptotically smaller than fails to contain some outbreak. The source notes a weaker version in which is required to be a polynomial, and presents a corollary proving the polynomial case.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Danny Dyer, Eduardo Martinez-Pedroza and Brandon Thorne, “The Coarse Geometry of Hartnell's Firefighter Problem on Infinite Graphs”, arXiv:1507.03050 (2017).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.