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.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.