Home » Author index

Plummer, Michael D.


Graph Theory » Basic G.T. » Matchings

Exponentially many perfect matchings in cubic graphs ★★★

Author(s): Lovasz; Plummer

Conjecture   There exists a fixed constant $ c $ so that every $ n $-vertex cubic graph without a cut-edge has at least $ e^{cn} $ perfect matchings.

Keywords: cubic; perfect matching

Posted by mdevos
updated December 15th, 2010
2 comments
Syndicate content