I am looking for a method/algorithm to find the maximum edges possible for a bipartite graph where one part only has nodes of degree one.
I guess a good example would be an algorithm matching as many students as possible to a teacher for a given class. Teachers will teach many students, but each student only has one teacher.
I would also want to modify such an algorithm to include other constraints, like availabilities for example.
Additionally, is there a name for this specific type of bipartite graph?