In 1935, the mathematician Philip Hall discovered a criteria of a perfect matching on a bipartite graph, known as Hall’s theorem, aka marriage theorem. Considering two sets of vertices, denoted as and . Edges are connected between and for some pairs of . Here, we admit multiple edges between two vertices. This graph, named as… Continue reading Hall's Theorem