30 citations · 89 across the 18 of their papers we have counts for
1 paper · 1 filter
Afshin Behmaram, Shmuel Friedland
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that so…