 Near-perfect matching

In a graph with $2n$ vertices, a near-perfect matching in a graph has $n-1$ edges and exactly two unmatched vertices.