| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652374 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
Lovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorhoeve (1979), and for planar graphs by Chudnovsky and Seymour (2008). In this paper, we provide the first superlinear bound in the general case.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
