Can I assume that in the match-making problem every vertex in L (i.e. boy) has an edge connecting it to R(i.e. girl) or could there be a vertex (boy) that has no edge (priority) connecting it to another vertex in R, (i.e. a monk)