Let F = { F 1 ,…} be a given class of forbidden graphs. A graph G is called F‐saturated if no F i ∈ F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F‐saturated graphs is examined. General estimations are given and the structure of minimal graphs is described for some special forbidden graphs (stars, paths, m pairwise disjoint edges).
No takes yet. Share an insight, caveat, or question.
Kászonyi et al. (1986) studied this question.