Prof. Emo Welzl and Prof. Bernd Gärtner
|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
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.
Automatic MiSe System Software Version 1.4803M | admin login