Paragraph

Let \(G\) be a bipartite graph with sets \(A\) and \(B\text{.}\) Then \(G\) has a matching of \(A\) if and only if

\begin{equation*} |N(S)| \ge |S| \end{equation*}

for all \(S \subseteq A\text{.}\)

in-context