The author investigates the average size of maximal matchings in graphs and proposes a technique to determine their asymptotic behavior.
