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 16, 2025, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Kalina Petrova (ISTA)
We show that, for any graph F and eta>0, there exists a d_0=d_0(F,eta) such that every n-vertex d-regular graph with d >= d_0 has a collection of vertex-disjoint F-subdivisions covering at least (1-eta)n vertices. This verifies a conjecture of Verstraete from 2002 and improves a recent result of Letzter, Methuku and Sudakov which additionally required d to be at least polylogarithmic in n. This is joint work with Richard Montgomery, Arjun Ranganathan, and Jane Tan.
Upcoming talks | All previous talks | Talks by speaker |
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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