Louis Esperet, Frantisek Kardos, Andrew King, Daniel Kral, Serguei Norine
Published 2010-12-13, updated 2011-09-05Version 2
We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656) perfect matchings. This confirms an old conjecture of Lovasz and Plummer. This version of the paper uses a different definition of a burl from the journal version of the paper and a different proof of Lemma 18 is given. This simplifies the exposition of our arguments throughout the whole paper.
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
An improved linear bound on the number of perfect matchings in cubic graphs
Line-graphs of cubic graphs are normal
![QR code for arXiv:1012.2878 [math.CO]](http://oss.arxitics.com/images/favicon.svg)