Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 10, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Andreas Noever
The KŁR conjecture (an embedding lemma for sparse regular graphs) was proved last year independently by Balogh, Morris, Samotij and Saxton, Thomason. The main tool used during the proof is a powerful container theorem for independent sets in hypergraphs. In this talk we present the proof of the KŁR conjecture based on these container theorems. We also show that with only slight modifications one obtains a generalised embedding lemma which allows one to put additional restrictions on the embedded graph F. For example we can require that F induces a triangle in some other fixed graph.
Automatic MiSe System Software Version 1.4803M | admin login