A bipartite graph can be divided into two sets of nodes where all edges have one end in each. The graph must be undirected. In a matching, no element of a set may appear in more than one pair ( each node may appear in at most one edge). Perfect edge means exactly one edge for every node(no disconnected nodes). These concepts are firmly imbued with Network Flow. We will use concepts shown by Network Flow to attempt to solve the problem: What is the size of the largest matching in a some bipartite graph G? As we will learn, this problem requires advanced techniques to solve which we have not yet covered.