Largest minimal percolating sets in hypercubes under 2-bootstrap percolation

MaRDI QIDQ976739zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r80.html

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)

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

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)