Bipartite Toughness and 𝑘-Factors in Bipartite Graphs

Figure 2

For proof of Lemma 2.1, red dashed line is the minimum cut.