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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 21, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Frank Mousset

Hypergraph Containers

This talk is about the recent Balogh-Morris-Samotij and Saxton-Thomason container theorems for independent sets in hypergraphs. In its most typical application, that of H-free graphs, these theorems state roughly that every H-free graph is contained in one of few graphs that are almost H-free.

We will see how such a theorem can be used to prove the following random version of Turán's Theorem: every H-free subgraph of G(n,p) contains at most (1-1/(χ(H)-1)+o(1))pn2/2 edges. Finally, we will present some ideas used in the proof of the container theorem by proving a simplified version due to Kleitman and Winston.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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