Slow graph bootstrap percolation II: Accelerating properties

David Fabian, Patrick Morris, Tibor Szabó

For a graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap process on $G$ is the process which starts with $G$ and, at every time step, adds any missing edges on the vertices o…