Fullerene graphs have exponentially many perfect matchings
Combinatorics
2010-05-28 v2 Mathematical Physics
math.MP
Abstract
A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.
Keywords
Cite
@article{arxiv.0801.1438,
title = {Fullerene graphs have exponentially many perfect matchings},
author = {Frantisek Kardos and Daniel Král' and Jozef Miskuf and Jean-Sébastien Sereni},
journal= {arXiv preprint arXiv:0801.1438},
year = {2010}
}
Comments
7 pages, 3 figures