{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:05:53Z","timestamp":1780743953849,"version":"3.54.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Bootstrap percolation is one of the simplest cellular automata. In $r$-bootstrap percolation on a graph $G$, an infection spreads according to the following deterministic rule: infected vertices of $G$ remain infected forever and in consecutive rounds healthy vertices with at least $r$ already infected neighbours become infected. Percolation occurs if eventually every vertex is infected. In this paper we prove that in the case of $2$-bootstrap percolation on the $n$-dimensional hypercube the maximal time the process can take to eventually infect the entire vertex set is $\\lfloor \\frac{n^2}{3} \\rfloor$.<\/jats:p>","DOI":"10.37236\/2412","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:27:23Z","timestamp":1578713243000},"source":"Crossref","is-referenced-by-count":20,"title":["Maximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation"],"prefix":"10.37236","volume":"19","author":[{"given":"Micha\u0142","family":"Przykucki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2012,6,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i2p41\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i2p41\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:33:37Z","timestamp":1579300417000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i2p41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,13]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2012,4,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2412","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,13]]},"article-number":"P41"}}