Maximum running times for graph bootstrap percolation processes

MaRDI QIDQ6949754zbMATH OpenFDO

Authors David Fabian, Patrick Morris, Tibor Szabó

Publication date 1 August 2025

zbMATH Keywords

cellular automataextremal combinatoricsweak saturationbootstrap percolationmonotone cellular automata

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Maximum running times for graph bootstrap percolation processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949754)