Publikace na Matematicko-fyzikální fakulta |
2011
Abstrakt
We prove a conjecture of Lovasz and Plummer that every cubic bridgeless graph contains an exponential number of perfect matchings.
We prove a conjecture of Lovasz and Plummer that every cubic bridgeless graph contains an exponential number of perfect matchings.