For a finite graph $G$, the maximum cardinality of a matching is
\begin{align*}
\frac{1}{2}\min_{S \subset V(G)} \left(|V(G)| + |S| - o(G-S)\right).
\end{align*}
Equivalently, the minimum possible number of exposed vertices in a matching is
\begin{align*}
\max_{S \subset V(G)} \left(o(G-S)-|S|\right).
\end{align*}