Bollobás, B., Przykucki, M., Riordan, O., & Sahasrabudhe, J. (2017). On the Maximum Running Time in Graph Bootstrap Percolation. The Electronic Journal of Combinatorics, 24(2), P2.16. https://doi.org/10.37236/5771