ABSTRACT Given a nonnegative integer weight for each vertex in a multigraph , an ‐bounded subgraph of is a multigraph contained in such that for all . Using Tutte's ‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an ‐bounded subgraph of . When for all , the formula reduces to the classical Tutte–Berge Formula for the maximum size of a matching.
Qu et al. (Mon,) studied this question.