A general framework of chain constructions yields quadratic or almost quadratic lower bounds on the maximum running time of H-bootstrap percolation for dense graphs, random graphs, wheels, and bipartite graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Slow graph bootstrap percolation III: Chain constructions
A general framework of chain constructions yields quadratic or almost quadratic lower bounds on the maximum running time of H-bootstrap percolation for dense graphs, random graphs, wheels, and bipartite graphs.