Authors: Marek Cygan ¹; Marcin Pilipczuk ¹; Riste Škrekovski ²

• 1 Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
• 2 Faculty of Mathematics and Physics [Ljubljana]

The famous conjecture of Lovász and Plummer, very recently proven by Esperet et al. (2011), asserts that every cubic bridgeless graph has exponentially many perfect matchings. In this paper we improve the bound of Esperet et al. for a specific subclass of cubic bridgeless graphs called the Klee-graphs. We show that every Klee-graph with n ≥8 vertices has at least 3 *2(n+12)/60 perfect matchings.