Fullerene graphs have exponentially many perfect matchings
classification
🧮 math.CO
math-phmath.MP
keywords
fullereneexponentiallygraphgraphsmanymatchingsperfectconnected
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.