Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, August 16, 2012, 12:15 pm
Duration: 30 minutes
Location: HG D5.2
Speaker: Otfried Cheong (Korea Advanced Institute of Science and Technology (KAIST), South Korea)
A graph embedded in the plane has a fan crossing if some edge crosses two edges that share an endpoint. We prove that a graph without fan crossings on n vertices has at most 4n-8 edges, and give generalizations to various other forbidden patterns for the set of edges crossed by an edge.
Automatic MiSe System Software Version 1.4803M | admin login