Finding more perfect matchings in leapfrog fullerenes

摘要

We use some recent results on the existence of long cycles in leapfrog fullerenes to establish new exponential lower bounds on the number of perfect matchings in such graphs. The new bounds are expressed in terms of Fibonacci numbers.