The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an independent edge set.

independent edge set | matching number | well-covered graph