Universal Vertices and Saturation Numbers for Disjoint Triangles

Xiaoteng Zhou, Naoyuki Kamiyama

A graph $G$ is $\mathcal{F}$-saturated if $G$ contains no member of $\mathcal{F}$, but the addition of any non-edge creates a copy of a member of $\mathcal{F}$. For $m\ge 1$, let $(m+…