48 citations · 48 across the 1 of their papers we have counts for
1 paper
M. Bayati, C. Borgs, J. Chayes +1
We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programming relaxation of the problem has no fracti…