Home / Get Math Help
Near-perfect Matching
Definition
A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, near-perfect matchings can occur only for graphs with an odd number of vertices.
Related terms