Largest minimal percolating sets in hypercubes under 2-bootstrap percolation

zbMATH Open1228.60114MaRDI QIDQ976739FDOQ976739

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• Extremal bounds for bootstrap percolation in the hypercube
• Extremal bounds for bootstrap percolation in the hypercube
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Maximal induced paths and minimal percolating sets in hypercubes
• Minimal percolating sets in bootstrap percolation

Cited in

(28)

• Extremal bounds for bootstrap percolation in the hypercube
• The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results
• Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
• On the \(P_3\)-hull number of Kneser graphs
• Rumor spreading: A trigger for proliferation or fading away
• Dynamic monopolies in two-way bootstrap percolation
• The maximum time of 2-neighbor bootstrap percolation: complexity results
• On slowly percolating sets of minimal size in bootstrap percolation
• The time of bootstrap percolation with dense initial sets
• Extremal bounds for bootstrap percolation in the hypercube
• Saturation in the hypercube and bootstrap percolation
• The time of bootstrap percolation with dense initial sets for all thresholds
• Largest and smallest minimal percolating sets in trees
• Minimal percolating sets in bootstrap percolation
• Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
• Maximal induced paths and minimal percolating sets in hypercubes
• On the spread of influence in graphs
• Target set selection with maximum activation time
• Lower bounds for graph bootstrap percolation via properties of polynomials
• Neighborhood growth dynamics on the Hamming plane
• Minimum degree conditions for small percolating sets in bootstrap percolation
• A cube dismantling problem related to bootstrap percolation
• Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• On the maximum running time in graph bootstrap percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Bootstrap Percolation on Degenerate Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976739)