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, April 09, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Meghana M. Reddy

Simple Topological Drawings of k-Planar Graphs

Every graph that admits a topological drawing also admits a simple topological drawing. It is easy to observe that every 1-planar graph admits a 1-plane simple topological drawing. It has been shown that 2-planar graphs and 3-planar graphs also admit 2-plane and 3-plane simple topological drawings respectively. However, nothing has been proved for simple topological drawings of k-planar graphs for k > 3. In fact, it has been shown that there exist 4-planar graphs which do not admit a 4-plane simple topological drawing, and the idea can be extended to k-planar graphs for k > 4. We prove that there exists a function f : N -> N such that every k-planar graph admits an f(k)-plane simple topological drawing for all k > 3. This answers a question posed by Schaefer. This is joint work with Chih-Hung Liu and Csaba D. Tóth.


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