The weak saturation number of ${\mathbf{K}}_{2,\mathbf{t}}$

Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie

For two graphs $G$ and $F$, we say that $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ as a subgraph and one could join all the nonadjacent pairs of vertices of $G$ in…