The size of the smallest percolating sets in d-neighbour bootstrap percolation on [n]^d is n^{d-1} for all d ≥ 1, with percolation time at most c_d n^2.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Smallest percolating sets in bootstrap percolation on grids
The size of the smallest percolating sets in d-neighbour bootstrap percolation on [n]^d is n^{d-1} for all d ≥ 1, with percolation time at most c_d n^2.