Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Friday, May 17, 2019, 12:15 pm
Duration: 45 minutes
Location: CAB G59
Speaker: Yau Guo Xian
In study of planarity of a graph, one often ask if we can draw a graph G without two edges crossing? Obviously not all graphs are planar, so how far away is a graph from being planar? This second question is answered by crossing lemma for simple graphs. Can we say the same thing for multigraph? In particular, how far away is a multigraph G from being planar? In this talk we will attempt to answer this question.
Automatic MiSe System Software Version 1.4803M | admin login