Bollobás, B., M. Przykucki, O. Riordan, and J. Sahasrabudhe. “On the Maximum Running Time in Graph Bootstrap Percolation”. The Electronic Journal of Combinatorics, Vol. 24, no. 2, May 2017, p. P2.16, doi:10.37236/5771.