{
  "id": "0801.1438",
  "version": "v2",
  "published": "2008-01-09T14:25:10.000Z",
  "updated": "2010-05-27T16:14:44.000Z",
  "title": "Fullerene graphs have exponentially many perfect matchings",
  "authors": [
    "Frantisek Kardos",
    "Daniel Král'",
    "Jozef Miskuf",
    "Jean-Sébastien Sereni"
  ],
  "comment": "7 pages, 3 figures",
  "journal": "Journal of Mathematical Chemistry 46(2):443--447, 2009",
  "doi": "10.1007/s10910-008-9471-7",
  "categories": [
    "math.CO",
    "math-ph",
    "math.MP"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2010-05-27T16:14:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C70",
      "92E10"
    ],
    "keywords": [
      "fullerene graph",
      "perfect matchings"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}