Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, December 13, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Luca Gugelmann

Exponentially Many Matchings in Cubic Bridgeless Graphs

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login