Weak saturation stability

Olga Kalinichenko, Maksim Zhukovskii

The paper studies wsat$(G,H)$ which is the minimum number of edges in a weakly $H$-saturated subgraph of $G$. We prove that wsat$(K_n,H)$ is `stable' - remains the same after indep…