Upper bounds for perfect matchings in Pfaffian and planar graphs (Q1953454)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds for perfect matchings in Pfaffian and planar graphs |
scientific article |
Statements
Upper bounds for perfect matchings in Pfaffian and planar graphs (English)
0 references
7 June 2013
0 references
Summary: 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.
0 references
perfect matchings
0 references
Pfaffian graphs
0 references
fullerene graphs
0 references
Hadamard/s determinant inequality
0 references
