Bollobás, Béla, Michał Przykucki, Oliver Riordan, and Julian Sahasrabudhe. “On the Maximum Running Time in Graph Bootstrap Percolation”. The Electronic Journal of Combinatorics 24, no. 2 (May 5, 2017): P2.16. Accessed March 17, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p16.