| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654145 | European Journal of Combinatorics | 2010 | 19 Pages |
Abstract
We show that every cubic bridgeless graph with nn vertices has at least 3n/4−103n/4−10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Louis Esperet, Daniel Král’, Petr Škoda, Riste Škrekovski,