The saturation number of $K_{3,3}$

Shenwei Huang, Hui Lei, Yongtang Shi +1

A graph $G$ is called $F$-saturated if $G$ does not contain $F$ as a subgraph (not necessarily induced) but the addition of any missing edge to $G$ creates a copy of $F$. The satur…