The maximal matching-generating polynomial 
for the graph 
may be defined as the polynomial
 |
where 
is the lower matching
number, 
is the (upper) matching
number, and the coefficient 
of 
is the number of maximal
independent edge sets in the graph 
.
