Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 13, 2011, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Luca Gugelmann
Determining the number of different perfect matchings in a cubic bridgeless graph has been an open problem for decades. In the '70s Lovász and Plummer conjectured that for any such graph on n vertices this number should be at least 2^(cn) for some constant c. Since then much has been published about this problem, but it was only very recently that Esperet, Kardoš, King, Král' and Norine finally cracked it. In this talk we present an overview of their proof.
Automatic MiSe System Software Version 1.4803M | admin login