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, December 09, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Angelika Steger

The degree distribution of random planar graphs

A random planar graph P_n is a graph drawn uniformly at random from the class of all (labelled) planar graphs on n vertices. In this talk we show that with probability 1-o(1) the number of vertices of degree k in P_n is very close to a quantity d_k n that we determine explicitly. Here k=k(n) \le c log n. In the talk our main emphasis will be on the techniques for proving such results.

Joint work with Konstantinos Panagiotou.

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