A maximal matching is a matching M of the graph G that is not a subset of another matching. A matching M of a graph G is maximal if each individual edge in G provides a non-vacant intersection with at least 1 edge in M. The next figure shows examples https://firift.com/unlocking-potential-the-impact-of-mentor-matching-engines/