ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PmP_m and PnP_n be paths on mm and nn vertices, respectively, and let Pm□PnP_m\square P_n denote their Cartesian product. For a graph GG, write σ(p,q)(G)\sigma_{(p,q)}(G) for its (p,q)(p,q)-spreading number. Spreading-number equality conjecture. If m,n≥3m,n\ge 3, then

σ(3,3)(Pm□Pn)=σ(3,4)(Pm□Pn).\sigma_{(3,3)}(P_m\square P_n)=\sigma_{(3,4)}(P_m\square P_n).

The conjecture concerns the unresolved (3,q)(3,q)-spreading numbers for rectangular grid graphs. Since every vertex of Pm□PnP_m\square P_n has degree at most 44, the (3,4)(3,4)- and (3,∞)(3,\infty)-spreading numbers coincide; the conjectured equality would therefore also identify the (3,3)(3,3)-spreading number with the corresponding bootstrap percolation number, whose exact values are not known in general.

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.