Equality of (3,3)- and (3,4)-spreading numbers on grid graphs
Statement
Let and be paths on and vertices, respectively, and let denote their Cartesian product. For a graph , write for its -spreading number. Spreading-number equality conjecture. If , then
The conjecture concerns the unresolved -spreading numbers for rectangular grid graphs. Since every vertex of has degree at most , the - and -spreading numbers coincide; the conjectured equality would therefore also identify the -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.