Fullerene graphs with exponentially many perfect matchings (Q1025756): Difference between revisions

We show that for all sufficiently large even \(p\) there is a fullerene graph on \(p\) vertices that has exponentially many perfect matchings in terms of the number of vertices. Further, we show that all fullerenes with full icosahedral symmetry group have exponentially many perfect matchings and indicate how such results could be extended to the fullerenes with lower symmetry.