The Minimum Number of Edges in $(p+1)K_2$-Saturated Graphs

Xiaoteng Zhou, Kazuya Haraguchi, Hanchun Yuan

Given a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-saturated if it is $\mathcal{F}$-free but the addition of any missing edge creates a copy of some $F \in \mathc…