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: Friday, May 17, 2019, 12:15 pm

Duration: 45 minutes

Location: CAB G59

Speaker: Yau Guo Xian

A crossing lemma for multigraphs

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.

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