Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture for the running time
Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture for the running time
Let denote the maximum running time of the infection process over starting graphs on vertices. Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture.
The conjecture concerns the outstanding determination of the asymptotic maximum running time for the process. The paper notes that the conjectured upper bound was proved by Balogh et al. using a construction based on Behrend sets.
Sources & referencesView supporting material
Primary source
David Fabian, Patrick Morris and Tibor Szabó, “Graph bootstrap percolation – a discovery of slowness”, arXiv:2602.12736 (2026).
Additional references
2 papers in this index state this conjecture (2019–2026). The statement above is taken from the most recent of them; the others are arXiv:1907.04559.
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
Sign in to submit a solution.
No solutions have been posted yet.