Maximal matching
= Maximal matching
A matching is maximal when no edge can be added to it, and maximum when no matching has more edges. Every maximum matching is maximal, and the unmatched vertices of a maximal matching form an independent set.
Maximality is a property of a <matching in a graph>, distinct from maximum cardinality.