Matchings Berge’s theorem Finding maximum matching in a bipartite graph It is possible to find a maximum matching in a bipartite graph in linear time Exercise Hall theorem Exercise Exercise