Minimum degree conditions for small percolating sets in bootstrap percolation
From MaRDI portal
Publication:2185227
DOI10.37236/6937zbMath1441.60080arXiv1703.10741OpenAlexW3028781085MaRDI QIDQ2185227
Publication date: 4 June 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.10741
Extremal problems in graph theory (05C35) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Deterministic bootstrap percolation on trees, Active influence spreading in social networks, On the spread of influence in graphs
Cites Work
- On slowly percolating sets of minimal size in bootstrap percolation
- New bounds for contagious sets
- Linear algebra and bootstrap percolation
- Largest and smallest minimal percolating sets in trees
- Maximal percolation time in hypercubes under 2-bootstrap percolation
- Bootstrap percolation on the hypercube
- Minimal percolating sets in bootstrap percolation
- Contagious sets in dense graphs
- Contagious sets in random graphs
- Lower bounds for graph bootstrap percolation via properties of polynomials
- Smallest percolating sets in bootstrap percolation on grids
- Minimal contagious sets in random regular graphs
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Random disease on the square grid
- Bootstrap Percolation in High Dimensions
- Ore and Chvátal‐type degree conditions for bootstrap percolation from small sets
- Contagious Sets in Expanders
- On a problem of K. Zarankiewicz
- Extremal bounds for bootstrap percolation in the hypercube
