Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, April 11, 2024, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Eoin Hurley (University of Amsterdam)
Inspired by the network routing literature, we develop what we call a "Pre-Emptive Greedy Algorithm" to embed bounded degree induced trees in sparse expanders. This generalises (with mild extra conditions) a powerful result of Friedman and Pippenger to the induced setting. As corollaries we obtain that a sparse random graph contains all bounded degree trees of linear order (whp) and that the induced and size induced Ramsey numbers of bounded degree trees are linear. No such linear bounds were previously known. We also prove a near-tight result on induced forests in countable expanders. We expect that the theorem will find many more applications. This is joint work with António Girão.
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