Cycle-saturated graphs with minimum number of edges

Zoltan Furedi, Younjin Kim

A graph $G$ is called $H$-saturated if it does not contain any copy of $H$, but for any edge $e$ in the complement of $G$ the graph $G+e$ contains some $H$. The minimum size of an…