Lower Matching Number

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.

See also

Independent Edge Set, Matching Number, Well-Covered Graph

Explore with Wolfram|Alpha

More things to try:

Cite this as:

Weisstein, Eric W. "Lower Matching Number." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LowerMatchingNumber.html

Subject classifications