Back to Search
Start Over
Exponentially many perfect matchings in cubic graphs
- Source :
-
Advances in Mathematics . Jul2011, Vol. 227 Issue 4, p1646-1664. 19p. - Publication Year :
- 2011
-
Abstract
- Abstract: We show that every cubic bridgeless graph G has at least perfect matchings. This confirms an old conjecture of Lovász and Plummer. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00018708
- Volume :
- 227
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Advances in Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 60653744
- Full Text :
- https://doi.org/10.1016/j.aim.2011.03.015