A note on the saturation number for unions of three cliques

Hanlai Lin, Zhen He, Yiduo Xu

A graph $G$ is $F$-saturated if $G$ contains no copy of $F$ but $G+e$ contains a copy of $F$ for every missing edge $e$ of $G$. The saturation number $\sat(n,F)$ is the minimum num…