The time of graph bootstrap percolation
Graph bootstrap percolation, introduced by Bollob\'as in 1968, is a cellular automaton defined as follows. Given a "small" graph $H$ and a "large" graph $G = G_0 \subseteq K_n$, in consecutive steps we obtain $G_{t+1}$ from $G_t$ by adding to it all new edges $e$ such that $...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Wiley
2016
|