Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, November 06, 2003, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Stefanie Gerke
After providing a brief summary of known results on labelled random planar graphs on n nodes, we show in more detail that if such a graph is picked uniformly at random then the expected number of edges is at least 13/7n + o(n). To prove this result we give a lower bound on the size of the set of edges that can be added to a planar graph on n nodes and m edges while keeping it planar and in particular we see that if m is at most 13/7n - c (for a suitable constant c) then at least this number of edges can be added.
Automatic MiSe System Software Version 1.4803M | admin login