  In this paper, we consider the average size of independent edge sets, also
called matchings, in a graph. We characterize the extremal graphs for the
average size of matchings in general graphs and trees. In addition, we obtain
inequalities between the average size of matchings and the number of matchings
as well as the matching energy, which is defined as the sum of the absolute
values of the zeros of the matching polynomial.
