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, November 17, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Dirk Schlatter (HU Berlin)

The random planar graph process

We consider the following variant of Gn,m: Having chosen the next edge u.a.r., only insert it if the graph remains planar. As soon as the edge density is greater than 1, the graph is a.a.s. connected and contains linearly many copies of some fixed planar graph. The first property is in contrast and the second one in accordance with the uniformly random planar graph studied by Gerke, McDiarmid, Steger, and Weissl.

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