Balogh–Bollobás asymptotic conjecture for bootstrap percolation in the hypercube
Let be fixed, and let be the graph with vertex set in which two vertices are adjacent when they differ in exactly one coordinate. For the -neighbour bootstrap process on , let denote the minimum cardinality of an initial set that percolates. Balogh–Bollobás conjecture. As ,
The conjecture gives the asymptotic minimum size of a percolating set in the high-dimensional hypercube. The source paper states that it proves this conjecture, so its status is solved.
References
2 papers in this index state this conjecture (2011–2015). The statement above is taken from the most recent of them; the others are arXiv:1107.1410.
Status
- Solved: Natasha Morrison and Jonathan A. Noel. Extremal Bounds for Bootstrap Percolation in the Hypercube (Journal of Combinatorial Theory, Series A, 2018) https://arxiv.org/html/1506.04686v2
Source: Natasha Morrison and Jonathan A. Noel, “Extremal Bounds for Bootstrap Percolation in the Hypercube”, arXiv:1506.04686 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.