Saturation (graph theory)

Given a graph

, another graph

does not contain a (not necessarily induced) copy of

, but adding any edge to

The function

is the minimum number of edges an

-saturated graph

vertices can have.

[1] In matching theory, there is a different definition.

be a graph and

with no such edge is said to be unsaturated by

This graph theory-related article is a stub.

You can help Wikipedia by expanding it.