ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path graph on nn vertices, let Pn□PnP_n\mathbin{\square}P_n be the Cartesian-product square grid, and let DRMVS⁡(G,s;d,b)\operatorname{DRMVS}(G,s;d,b) denote the maximum number of vertices saved in the distance-restricted firefighting process on graph GG, starting from source ss, with distance restriction dd and bb firefighter available per time step. The fire starts at the central vertex ((⌈n/2⌉,⌈n/2⌉))((\lceil n/2\rceil,\lceil n/2\rceil)) of the square grid, with one firefighter and distance restriction one. The density conjecture.

lim⁡n→∞DRMVS⁡(Pn□Pn,(⌈n2⌉,⌈n2⌉);1,1)n2=18\lim_{n \to \infty} \frac{\operatorname{DRMVS}\left(P_n \mathbin{\square} P_n,\left(\left\lceil\frac{n}{2}\right\rceil,\left\lceil\frac{n}{2}\right\rceil\right);1,1\right)}{n^2} = \frac18

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.