Matching number
Материал из WikiGrapp
Matching number --- число паросочетания.
The matching number [math]\displaystyle{ v(H) }[/math] of a hypergraph [math]\displaystyle{ H }[/math] is the maximal size of a ' matching in [math]\displaystyle{ H }[/math].
Another name is the Edge-independent number.
