Slow graph bootstrap percolation I: Cycles

David Fabian, Patrick Morris, Tibor Szabó

Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$\emph{-bootstrap percolation process} on $G$ is defined to be the sequence of graphs $G_i$, $i\ge 0$ which starts with…