On the maximum running time in graph bootstrap percolation
Graph bootstrap percolation is a simple cellular automaton introduced by Bollob´as in 1968. Given a graph H and a set G ⊆ E(Kn) we initially “infect” all edges in G and then, in consecutive steps, we infect every e ∈ Kn that completes a new infected copy of H in Kn. We say that G percolates if event...
| Hauptverfasser: | , , , |
|---|---|
| Format: | Journal article |
| Veröffentlicht: |
Electronic Journal of Combinatorics
2017
|