Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, January 16, 2018, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Olaf Parczyk (Goethe University Frankfurt)
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.
Automatic MiSe System Software Version 1.4803M | admin login