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, May 04, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Andreas Weissl

On the number of labelled planar graphs with n nodes and qn edges

Recently C. McDiarmid, A. Steger and C. J.A. Welsh presented in their paper "Random Planar Graphs", that there exists a constant gammal, the 'labelled planar graph growth constant' such that (l(n) / n!){1/n} converges to gammal as n approaches infinity, where l(n) denotes the number of labelled planar graphs on n nodes. From this, they deduced structural statements about the random planar graph. My talk will focus on the number of planar graphs on n nodes with a fixed number of edges, i.e. f(n, qn). I will present a proof sketch that (f(n, qn) / n!){1/n} converges to gamma as n goes to infinity.

(Joint work with C. McDiarmid, S. Gerke, A. Steger)

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