The sublinear running-time dichotomy conjecture

Let HH be a connected infection rule, and let MH(n)M_H(n) denote its maximum running time. Sublinear dichotomy conjecture. If

MH(n)=o(n),M_H(n)=o(n),

then

MH(n)=Θ(1)orMH(n)=Θ(logn).M_H(n)=\Theta(1)\quad\text{or}\quad M_H(n)=\Theta(\log n).

The paper describes the classification of connected infection rules with sublinear maximum running time as open. The conjecture predicts that no other asymptotic growth rates occur in the sublinear regime.

Sources & referencesView supporting material

Primary source

David Fabian, Patrick Morris and Tibor Szabó, “Graph bootstrap percolation – a discovery of slowness”, arXiv:2602.12736 (2026).

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.