\(K_{r,s}\) graph bootstrap percolation

DOI10.37236/8997zbMath1486.05273arXiv1904.12764OpenAlexW2941695383MaRDI QIDQ2121788

Erhan Bayraktar, Suman Chakraborty

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.12764

zbMATH Keywords

weak saturationbootstrap percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(K_{s,t}\)-saturated bipartite graphs
• An extremal problem for sets with applications to graph theory
• An extremal problem for two families of sets
• On \(K_{2, t}\)-bootstrap percolation
• Weak saturation numbers of complete bipartite graphs in the clique
• Exact bounds for some hypergraph saturation problems
• Graph bootstrap percolation

This page was built for publication: \(K_{r,s}\) graph bootstrap percolation