Abstract: Lovasz and Plummer conjectured that there exist a xed positive con-stant c such that every
cubic n-vertex graph with no cutedge has at least 2cn perfect matchings. Their conjecture has
been veried for bipartite graphs by Voorhoeve and planar graphs by Chudnovsky and Seymour.
We prove that every claw-free cubic n-vertex graph with no cutedge has more than 2n=18
perfect matchings, thus verifying the conjecture for claw-free graphs.