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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 03, 2011, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Anna Gundert

Counting "hypertrees": A generalization of Cayley's formula

Cayley's famous formula states that the number of labeled trees on $n$ vertices is $n^{n-2}$. Kalai was able to generalize this result to higher dimensional simplicial complexes by introducing a suitable notion of a higher dimensional "tree". His proof closely follows the proof of Cayley's formula via the matrix tree theorem. In this talk, we review this proof for the graph case and see how it adapts to dimension 2.


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

Previous talks by year:   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