Largest minimal percolating sets in hypercubes under 2-bootstrap percolation

zbMath1228.60114MaRDI QIDQ976739

Eric Riedl

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226637

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (18)

Maximal induced paths and minimal percolating sets in hypercubes ⋮ The time of bootstrap percolation with dense initial sets for all thresholds ⋮ Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box ⋮ Neighborhood growth dynamics on the Hamming plane ⋮ The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results ⋮ Dynamic monopolies in two-way bootstrap percolation ⋮ On slowly percolating sets of minimal size in bootstrap percolation ⋮ The maximum time of 2-neighbor bootstrap percolation: complexity results ⋮ The time of bootstrap percolation with dense initial sets ⋮ Target set selection with maximum activation time ⋮ A cube dismantling problem related to bootstrap percolation ⋮ Rumor spreading: A trigger for proliferation or fading away ⋮ On the maximum running time in graph bootstrap percolation ⋮ Bootstrap Percolation on Degenerate Graphs ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ On the spread of influence in graphs ⋮ The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results ⋮ The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects

This page was built for publication: Largest minimal percolating sets in hypercubes under 2-bootstrap percolation