On the saturation spectrum of the unions of disjoint cycles

Yue Ma

Let $G$ be a graph and $\mathcal{H}$ be a family of graphs. We say $G$ is $\mathcal{H}$-saturated if $G$ does not contain a copy of $H$ with $H\in \mathcal{H}$, but the addition of…