Fullerene Graphs with Exponentially Many Perfect Matchings

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.

[1]  Tomislav Došlić,et al.  Cyclical Edge-Connectivity of Fullerene Graphs and (k, 6)-Cages , 2003 .

[2]  T. Došlić.  Importance and redundancy in fullerene graphs , 2002 .

[3]  D. Manolopoulos,et al.  An Atlas of Fullerenes , 1995 .

[4]  Douglas J. Klein,et al.  Dimer coverings and Kekulé structures on honeycomb lattice strips , 1986 .

[5]  P. W. Kasteleyn.  Dimer Statistics and Phase Transitions , 1963 .

[6]  S. J. Cyvin,et al.  Kekule Structures in Benzenoid Hydrocarbons , 1988 .

[7]  Frank Harary,et al.  Graph Theory , 2016 .

[8]  Pierre Hansen,et al.  Fullerene isomers of C60. Kekulé counts versus stability , 1994 .

[9]  H. Sachs,et al.  Kekule Count in Tubular Hydrocarbons , 1994 .

[10]  Jianguo Qian,et al.  On the number of Kekulé structures in capped zigzag nanotubes , 2005 .

[11]  Heping Zhang,et al.  New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs , 2001 .

[12]  Perfect Matchings in Bipartite Lattice Animals: Lower Bounds and Realizability , 2005 .

[13]  Branko Grünbaum,et al.  The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra , 1963, Canadian Journal of Mathematics.

[14]  Patrick W. Fowler,et al.  Systematics of bonding in non-icosahedral carbon clusters , 1988 .

[15]  Tomislav Došlić.  Perfect matchings in lattice animals and lattice paths with constraints , 2005 .

[16]  Tomislav Došlić.  On lower bounds of number of perfect matchings in fullerene graphs , 1998 .

[17]  Douglas J. Klein,et al.  Theorems for carbon cages , 1992 .

[18]  Tomislav Došlić,et al.  On Some Structural Properties of Fullerene Graphs , 2002 .