MASCOTTE no longer exists => visit the new project-team
Seminaire MASCOTTEPerfect matchings in cubic graphs
par Frantisek Kardos
| Date : | 18/10/11 | | Time : | 10:30 | | Location : | Lagrange Gris |
Â' LovÃ'¡sz and Plummer conjectured in the 1970's that cubic bridgeless graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorhoeve in 1979, and for planar graphs by Chudnovsky and Seymour in 2008. Then several general lower bounds for the number of perfect matchings in cubic bridgeless graphs appeared, and finally, the conjecture has been settled recently. In this talk, a survey on methods used to attain these results is provided.
Page des séminaires
| 
