The time of graph bootstrap percolation
The time of graph bootstrap percolation
Graph bootstrap percolation, introduced by Bollobás in 1968, is a cellular automaton defined as follows. Given a “small” graph H and a “large” graph , in consecutive steps we obtain from Gt by adding to it all new edges e such that contains a new copy of H. We say …