Update kuhn_maximum_bipartite_matching.md

RomanSteinberg · adamant-pwn · commit 36de2cc200db · 2023-07-17T22:37:15.000+02:00
Two important terms are defined: maximal and maximum matching. The formulation of the Beurge's lemma requires maximum matching term definition. And it is important to show difference between maximal and maximum matching. It is also possible to state perfect and near perfect matching definition, but this particular article doesn't require them.
diff --git a/src/graph/kuhn_maximum_bipartite_matching.md b/src/graph/kuhn_maximum_bipartite_matching.md
@@ -26,6 +26,10 @@ by this matching.
 * An **augmenting path** (in a bipartite graph, with respect to some matching) is an alternating path whose initial and final vertices are unsaturated, i.e., 
 they do not belong in the matching. 
 
+* A **maximal matching** is a matching M of a graph G that is not a subset of any other matching.
+
+* A **maximum matching** (also known as maximum-cardinality matching) is a matching that contains the largest possible number of edges. Every maximum matching is a maximal matching.
+
 * The **symmetric difference** (also known as the **disjunctive union**) of sets $A$ and $B$, represented by $A \oplus B$, is the set of all elements that belong to exactly one of $A$ or $B$, but not to both. 
 That is, $A \oplus B = (A - B) \cup (B - A) = (A \cup B) - (A \cap B)$.
 
