| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4666650 | Advances in Mathematics | 2011 | 19 Pages |
Abstract
We show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect matchings. This confirms an old conjecture of Lovász and Plummer.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
