Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 27, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Anusch Taraz (HU Berlin)
We prove sufficient and essentially necessary conditions in terms of the minimum degree for a graph to contain planar subgraphs with many edges. For example, every graph with n vertices and minimum degree (2/3 + eps)n contains a triangulation as a spanning subgraph (if eps is an arbitrarily small positive constant and n is sufficiently large).
Automatic MiSe System Software Version 1.4803M | admin login