2011 (v1)
Journal article
We show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect matchings. This confirms an old conjecture of Lovász and Plummer.
Uploaded on: December 3, 2022