Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Friday, March 16, 2012, 12:15 pm
Duration: 30 minutes
Location: CAB G61
Speaker: David Cimasoni (Université de Genève)
A perfect matching on a (finite) graph G is a choice of edges such that each vertex of G is adjacent to exactly one of these edges. In general, counting perfect matchings is very difficult, but I will explain how this can be done in polynomial time for graphs of a fixed genus. During the 30 minutes of the Mittagsseminar, I will probably have time only to review Kasteleyn's theory for planar graphs. In the Reading Seminar, I will then show how this can be extended to arbitrary graphs (of a fixed genus). This is joint work with Nicolai Reshetikhin.
Automatic MiSe System Software Version 1.4803M | admin login