| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653884 | European Journal of Combinatorics | 2012 | 32 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 in 1979, and for planar graphs by Chudnovsky and Seymour in 2008, but in general only linear bounds are known. In this paper, we provide the first superlinear bound in the general case.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Louis Esperet, František Kardoš, Daniel Král’,