The density conjecture for distance-restricted firefighting on square grids
Statement
Let be the path graph on vertices, let be the Cartesian-product square grid, and let denote the maximum number of vertices saved in the distance-restricted firefighting process on graph , starting from source , with distance restriction and firefighter available per time step. The fire starts at the central vertex of the square grid, with one firefighter and distance restriction one. The density conjecture.
This conjectures the asymptotic proportion of vertices saved in the one-firefighter, distance-one process on increasingly large square grids. The supplied text reports computational evidence from many square-grid instances but gives no proof or resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.