Fullerene graphs have exponentially many perfect matchings
  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. 
Frantisek Kardos, Daniel Kr\'al', Jozef Miskuf, Jean-S\'ebastien   Sereni