Maximal induced paths and minimal percolating sets in hypercubes

For a graph g, the r-bootstrap percolation process can be described as follows: start with an initial set a of infected” vertices. infect any vertex with at least r infected neighbours, and continue this process until no new vertices can be infected. a is said to percolate in g if eventually all the vertices of g are infected. a is a minimal percolating set in g if a percolates in g and no proper subset of a percolates in g. an induced path, p, in a hypercube qn is maximal if no induced path in qn properly contains p. induced paths in hypercubes are also called snakes. we study the relationship between maximal snakes and minimal percolating sets (under 2-bootstrap percolation) in hypercubes. in particular, we show that every maximal snake contains a minimal percolating set, and that every minimal percolating set is contained in a maximal snake.