Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture for the K5K_5 running time

Let MK5(n)M_{K_5}(n) denote the maximum running time of the K5K_5 infection process over starting graphs on nn vertices. Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture.

MK5(n)=o(n2).M_{K_5}(n)=o(n^2).

The conjecture concerns the outstanding determination of the asymptotic maximum running time for the K5K_5 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

Never refreshed

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.