Why is bipartite graph matching hard?
I am reading on how [...] to solve unweighted bipartite graph matching problem. [...] The goal of the problem seems to be to find a maximum matching in a complete bipartite graph


No, the goal of the problem is to find a maximum matching in any unweighted bipartite graph.