Counting maximal near perfect matchings in quasirandom and dense graphs

Yifan Jing, Akbar Rafiey

A maximal $\epsilon$-near perfect matching is a maximal matching which covers at least $(1-\epsilon )|V(G)|$ vertices. In this paper, we study the number of maximal near perfe…