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: Friday, March 16, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G61

Speaker: David Cimasoni (Université de Genève)

Counting perfect matchings on graphs

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.

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