Fullerene graphs with exponentially many perfect matchings (Q1025756)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fullerene graphs with exponentially many perfect matchings
scientific article

    Statements

    Fullerene graphs with exponentially many perfect matchings (English)
    0 references
    0 references
    23 June 2009
    0 references
    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.
    0 references
    enumeration
    0 references
    fullerene graph
    0 references
    icosahedral fullerene
    0 references
    perfect matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references