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 some of our upper bounds are sharp for 3 and 4-regular Pfaffian graphs. We apply our results to fullerene graphs.
@article{10_37236_2845,
author = {Afshin Behmaram and Shmuel Friedland},
title = {Upper bounds for perfect matchings in {Pfaffian} and planar graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {1},
doi = {10.37236/2845},
zbl = {1266.05116},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2845/}
}
TY - JOUR
AU - Afshin Behmaram
AU - Shmuel Friedland
TI - Upper bounds for perfect matchings in Pfaffian and planar graphs
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/2845/
DO - 10.37236/2845
ID - 10_37236_2845
ER -
%0 Journal Article
%A Afshin Behmaram
%A Shmuel Friedland
%T Upper bounds for perfect matchings in Pfaffian and planar graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2845/
%R 10.37236/2845
%F 10_37236_2845
Afshin Behmaram; Shmuel Friedland. Upper bounds for perfect matchings in Pfaffian and planar graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/2845
