Slow graph bootstrap percolation III: Chain constructions

David Fabian, Patrick Morris, Tibor Szabó

For graphs $H$, we study the extremal function $M_H(n)$ which is the maximum running time (until stabilisation) of an $H$-bootstrap percolation process on $n$ vertices. Building on…