Charles Explorer logo
🇬🇧

A new lower bound on the number of perfect matchings in cubic graphs

Publication at Faculty of Mathematics and Physics |
2009

Abstract

We prove the first lower bound on the number of perfect matchings of cubic bridgeless graphs not based on the dimension of the perfect matchings polytope.