$K_{r,s}$ graph bootstrap percolation

Erhan Bayraktar, Suman Chakraborty

A graph $G$ percolates in the $K_{r,s}$-bootstrap process if we can add all missing edges of $G$ in some order such that each edge creates a new copy of $K_{r,s}$, where $K_{r,s}$…