![](/files/happy5.png)
Plummer, Michael D.
Exponentially many perfect matchings in cubic graphs ★★★
Conjecture There exists a fixed constant
so that every
-vertex cubic graph without a cut-edge has at least
perfect matchings.
![$ c $](/files/tex/dccee841f3f498c2c58fa6ae1c1403c5a88c5b8d.png)
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
![$ e^{cn} $](/files/tex/22656fabb8498ada6bf54e6068c4978436afcc8f.png)
Keywords: cubic; perfect matching
![Syndicate content Syndicate content](/misc/feed.png)
Keywords: cubic; perfect matching