Given a graph
, we say that a graph
is
‐saturated if
is not a subgraph of
, but the addition of any new edge to
creates at least one copy of
. In this paper we determine all pairs
for which there is a
‐saturated graph on
vertices and
edges. In addition, we determine all but
possible sizes for
‐vertex...