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: Tuesday, November 12, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Michael Hoffmann

On Universal Geometric Graphs

A graph G is universal for a class H of graphs if G contains every graph from H as a subgraph. Obviously, the complete graph K_n is universal for all graphs on n vertices, and it is the only graph with this property. Things get more interesting if we restrict our focus to a subclass C of n-vertex graphs and ask what is the minimum number of edges in an n-vertex graph that is universal for C. This type of question is well studied in the abstract setting. We study it in a geometric setting for families of planar graphs and plane drawings. Specifically, we obtain an n-vertex geometric graph with O(n log n) edges that is universal for plane forests on n vertices. The construction is based on a classic result by Chung and Graham for the abstract setting, and the bound on the number of edges is asymptotically optimal. Furthermore, we study the number of edges required in a convex geometric graph on n vertices that is universal for n-vertex outerplanar graphs. (Joint work with Fabrizio Frati 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