Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
type: Item
instance of: scholarly article
title: Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
zbMATH Open document ID: 1228.60114
author: Eric Riedl
published in: The Electronic Journal of Combinatorics
publication date: 2010-06-16T00:00:00Z
full work available at URL: https://eudml.org/doc/226637
full work available at URL: v17i1r80.html
review text: Summary: 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.
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5721474
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5721474