Upper bounds for perfect matchings in pfaffian and planar graphs
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.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| DOI: | 10.48550/arxiv.1210.6925 |