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: Thursday, June 26, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Manuel Wettstein

A Census of Planar Triangulations by W. T. Tutte

The title of this talk is borrowed from a classic paper by Tutte [1], in which he considers plane triangulations with a fixed triangular outer face and n additional interior nodes. The number of non-isomorphic such triangulations is shown to be roughly n^(-5/2) * 9.481^n. The analysis involves solving an intricate recurrence with the help of generating functions. We will discuss the first and most important steps of the proof in detail, but will gloss over some technical derivations at the end.

[1] W. T. Tutte, A Census of planar triangulations, Canadian Journal of Mathematics 14 (1962), 21-38.

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