A member of a collection of sets is said to be maximal if it is not a proper subset of another member set.
Maximal sets are important in graph theory since many graph theoretic algorithms require only maximal sets of edge and vertex collections and the numbers of maximal sets are typically much smaller than the total numbers of sets in a graph.
