Slow graph bootstrap percolation. I: Cycles

DOI10.5802/IGT.19MaRDI QIDQ7240350zbMATH OpenFDO

Authors David Fabian, Patrick Morris, Tibor Szabó

Publication date 11 May 2026

Published in Innovations in Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/IGT.19

zbMATH Keywords

bootstrap percolationextremal graph theoryrunning times

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Extremal combinatorics (05D99)

Cites work

• Bootstrap percolation, and other automata
• Graph bootstrap percolation
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• Long running times for hypergraph bootstrap percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On the maximum running time in graph bootstrap percolation
• On the running time of hypergraph bootstrap percolation
• Slow graph bootstrap percolation. II: Accelerating properties
• The maximal running time of hypergraph bootstrap percolation
• The maximum length of K_r-bootstrap percolation
• Theory of self-reproducing automata. Edited and completed by Arthur W. Burks

This page was built for publication: Slow graph bootstrap percolation. I: Cycles

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