Minimal Set

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set.

Minimal sets are important in graph theory, since many graph theoretic algorithms require only minimal sets of edge and vertex collections, and the numbers of minimal sets are typically much smaller than the total numbers of sets in a graph.

See also

Maximal Set, Minimal Dominating Set, Minimal Edge Cover, Minimal Vertex Cover

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Minimal Set." From MathWorld--A Wolfram Web Resource.

Subject classifications