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, February 23, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Miloš Trujić

Sparse blow-up lemma for cycles

Szemerédi's regularity lemma and the blow-up lemma of Komlós, Sárközy, and Szemerédi are some of the most powerful tools in modern combinatorics, which lead to many deep and beautiful results. The biggest 'flaw' of these tools is that they are not directly applicable in sparse settings. Nevertheless, in 2016, Allen, Böttcher, Hàn, Kohayakawa, and Person provided a first analog of the blow-up lemma applicable to sparse graphs. In this talk, we present a specific variant of the sparse blow-up lemma designed for cycles improving the result of previously mentioned authors. As an application of our blow-up lemma we resolve a question of Nenadov and Škorić regarding resilience of cycle factors in sparse random graphs.

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