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, January 16, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Olaf Parczyk (Goethe University Frankfurt)

Randomly perturbed graphs

We study the model of randomly perturbed dense graphs, that is, for any constant α>0, the union of some n-vertex graph Gα with minimum degree at least αn and the binomial random graph G(n,p). We introduce a general approach for studying the appearance of spanning subgraphs in this model. Using this, we can give simpler proofs of several results in the literature concerning the appearance of different spanning subgraphs in this model and obtain new results for bounded degree graphs, powers of Hamilton cycles and universality for bounded degree trees. This addresses two questions of Krivelevich, Kwan, and Sudakov. This is joint work with Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, and Yury Person.

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