Upper bounds for perfect matchings in pfaffian and planar graphs

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…