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, December 14, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Mihyun Kang (HU Berlin)

The Asymptotic Number of Outerplanar Graphs

An outerplanar graph is a graph that can be embedded in the plane in such a way that every vertex lies on the outer face. We decompose outerplanar graphs along their connectivity structure and derive the equations of the exponential generating functions. With a singularity analysis of these equations we show that the number of labeled outerplanar graphs on n vertices is asymptotically C n-5/2γnn! for constants C, γ = 7.32098. We also show that for constants α, β, the probability of a random outerplanar graph chosen uniformly at random being connected is asymptotically e = 0.86166, and that the expected number of edges in a random outerplanar graph on n vertices is asymptotically β n = 1.56251n.

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