Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, December 12, 2023, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Meghana M. Reddy
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. The Density Formula can be seen as a generalization of Euler's formula for Beyond-Planar graphs. We demonstrate its capability by providing a few applications: we prove tight upper bounds on the edge density of various beyond-planar graph classes, including so-called k-planar graphs with k=1,2, fan-crossing/fan-planar graphs, RAC-graphs, and some more. In some cases, the Density Formula can also be used to characterize graphs with optimal density or to obtain tight lower bound constructions. This is joint work with Michael Kaufmann, Boris Klemz, Kristin Knorr, Felix Schroder and Torsten Ueckerdt.
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