Combinatorial Methods in Bootstrap Percolation Problems

An elegant bootstrap percolation result on the hyperrectangle graph was proved by Balogh, Bollobás, Morris, and Riordan using a linear algebric method in 2012. This paper studies the same problem by purely combinatorial means. The base case is solved for all dimensions, and we pose open problems for the remaining cases.