Name
Abstract | ||
|---|---|---|
In standard bootstrap percolation, a subset A of the grid [n](2) is initially infected. A new site is then infected if at least two of its neighbours are infected, and an infected site stays infected forever. The set A is said to percolate if eventually the entire grid is infected. A percolating set is said to be minimal if none of its subsets percolate. Answering a question of Bollobas, we show that there exists a minimal percolating set of size 4n(2) /33 + o(n(2)), but there does not exist one larger than (n+2)(2)/6. |
Year | Venue | Field |
|---|---|---|
2009 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Combinatorics,Bootstrap percolation,Mathematics |
DocType | Volume | Issue |
Journal | 16.0 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 3 | 0.61 |
References | Authors | |
2 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Morris | 1 | 29 | 19.16 |