The maximum running time of F-bootstrap percolation on n vertices is at most (π(F minus one edge) plus o(1)) times the number of possible edges.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
For any graph G on t vertices and k at least 3, the maximum running time of the F-process where F is the k-extension of G is bounded by a constant C_{k,t} independent of n.
citing papers explorer
-
Upper bounds on the running time of bootstrap percolation
The maximum running time of F-bootstrap percolation on n vertices is at most (π(F minus one edge) plus o(1)) times the number of possible edges.
-
Bootstrap percolation of extension hypergraphs
For any graph G on t vertices and k at least 3, the maximum running time of the F-process where F is the k-extension of G is bounded by a constant C_{k,t} independent of n.