Structural remarks on bipartite graphs with unique \(f\)-factors (Q2494113)

A bipartite graph \(G\) with a unique \(k\)-factor is saturated if the bipartite graph obtained by the addition of any new edge of \(G\) results in a graph with at least two \(k\)-factors. It is shown that any saturated bipartite graph \(G\) with a unique \(k\)-factor will have exactly \(k\) vertices of degree \(k\) in each partite set of \(G\). More generally \(f\)-factors are considered for any integer-valued function \(f(v) \geq 1\) on the vertices \(v \in V(G)\), and corresponding results are proved for these \(f\)-factors as well.