Equality of (3,3)- and (3,4)-spreading numbers on grid graphs
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.
References
2 papers in this index state this conjecture (2021–2023). The statement above is taken from the most recent of them; the others are arXiv:2109.07875.
Source: Boštjan Brešar, Tanja Dravec, Aysel Erey and Jaka Hedžet, “Spreading in graphs”, arXiv:2309.16852 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.