Exponentially many perfect matchings in cubic graphs
Combinatorics
2015-09-28 v2
Abstract
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.
Cite
@article{arxiv.1012.2878,
title = {Exponentially many perfect matchings in cubic graphs},
author = {Louis Esperet and Frantisek Kardos and Andrew King and Daniel Kral and Serguei Norine},
journal= {arXiv preprint arXiv:1012.2878},
year = {2015}
}