Upper bounds for perfect matchings in pfaffian and planar graphs
classification
🧮 math.CO
math-phmath.MP
keywords
boundsuppergraphsmatchingsperfectpfaffianapplybetter
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.