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, March 16, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Stefan Glock

Long induced paths in sparse random graphs

The study of induced trees in random graphs was initiated by Erdős and Palka in the 80s. Many interesting questions remain unanswered, especially in the sparse case when the average degree is constant. For instance: what is the length of a longest induced path? Natural algorithms produce an induced path of length roughly half the conjectured optimal value, which has not been improved in the last 30 years. We show that one can do better than that, which answers a question of Fernandez de la Vega. Unfortunately, we only get halfway towards the upper bound. We will explain the main ideas and explore possible ways to close the remaining gap.

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