Weak saturation numbers of complete bipartite graphs in the clique

Gal Kronenberg, Taísa Martins, Natasha Morrison

The notion of weak saturation was introduced by Bollobás in 1968. Let $F$ and $H$ be graphs. A spanning subgraph $G\subseteq F$ is weakly $(F,H)$-saturated if it contains no copy…