Cycle-Saturated Graphs with Minimum Number of Edges
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 contains some H. The minimum size of an n-vertex H-saturated graph is denoted by . We prove
graphs cycles extremal graphs minimal saturated graphs