Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

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

Random Planar Graphs

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.

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