The time of graph bootstrap percolation

DOI10.1002/rsa.20660zbMath1370.05189arXiv1503.01454OpenAlexW2963112932MaRDI QIDQ5360872

Karen Gunderson, Michał Przykucki, Sebastian Koch

Publication date: 26 September 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01454

zbMATH Keywords

random graphsweak saturationbootstrap percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (7)

Long running times for hypergraph bootstrap percolation ⋮ Transitive closure in a polluted environment ⋮ On the running time of hypergraph bootstrap percolation ⋮ Line Percolation in Finite Projective Planes ⋮ On the maximum running time in graph bootstrap percolation ⋮ A sharp threshold for bootstrap percolation in a random hypergraph ⋮ On \(K_{2, t}\)-bootstrap percolation

This page was built for publication: The time of graph bootstrap percolation