Geodesic
Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Consider the following process, known as $r$-bootstrap percolation, on a graph $G$. Designate some initial infected set $A$ and infect any vertex with at least $r$ infected neighbors, continuing until no new vertices can be infected. We say $A$ percolates if it eventually infects the entire graph. We say $A$ is a minimal percolating set if $A$ percolates, but no proper subset percolates. We compute the size of a largest minimal percolating set for $r=2$ in the $n$-dimensional hypercube.
DOI : 10.37236/352
Classification : 60K35, 05C35 
@article{10_37236_352,
     author = {Eric Riedl},
     title = {Largest minimal percolating sets in hypercubes under 2-bootstrap percolation},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/352},
     zbl = {1228.60114},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/352/}
}
TY  - JOUR
AU  - Eric Riedl
TI  - Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/352/
DO  - 10.37236/352
ID  - 10_37236_352
ER  - 
%0 Journal Article
%A Eric Riedl
%T Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/352/
%R 10.37236/352
%F 10_37236_352
Eric Riedl. Largest minimal percolating sets in hypercubes under 2-bootstrap percolation. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/352

Cité par Sources :