Slow graph bootstrap percolation. II: Accelerating properties

DOI10.1016/J.JCTB.2024.12.006MaRDI QIDQ7006423zbMATH OpenFDO

Authors David Fabian, Patrick Morris, Tibor Szabó

Publication date 28 March 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.12.006

zbMATH Keywords

extremal graph theorygraph bootstrap percolationrunning times

Mathematics Subject Classification ID

Extremal combinatorics (05D99) Combinatorial probability (60C05)

Cites work

• Bootstrap percolation, and other automata
• Graph bootstrap percolation
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• Long running times for hypergraph bootstrap percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Maximum running times for graph bootstrap percolation processes
• On the maximum running time in graph bootstrap percolation
• On the running time of hypergraph bootstrap percolation
• The maximal running time of hypergraph bootstrap percolation
• The time of bootstrap percolation in two dimensions
• The time of bootstrap percolation with dense initial sets
• The time of bootstrap percolation with dense initial sets for all thresholds
• The time of graph bootstrap percolation

Cited in

(1)

• Slow graph bootstrap percolation. I: Cycles

This page was built for publication: Slow graph bootstrap percolation. II: Accelerating properties

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