The Maximal Running Time of Hypergraph Bootstrap Percolation
Ivailo Hartarsky, Lyuben Lichev · SIAM Journal on Discrete Mathematics · 2024
Abstract. We show that for every [Formula: see text], the maximal running time of the [Formula: see text]-bootstrap percolation in the complete [Formula: see text]-uniform hypergraph on [Formula: see text] vertices [Formula: see text] is [Formula: see text]. This answers a recent question of Noel and Ranganathan in the affirmative and disproves a conjecture of theirs. Moreover, we show that the prefactor is of the form [Formula: see text] as [Formula: see text].