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: Thursday, October 10, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Andreas Noever

A mixed density embedding lemma

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.

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