## 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, June 03, 2014, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Hong Liu (University of Illinois at Urbana-Champaign)

## The typical structure of graphs with no large cliques

In 1987, Kolaitis, Pr\"omel and Rothschild proved that, for every fixed $r \in \mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In this paper we extend this result to all functions $r = r(n)$ with $r \le (\log n)^{1/5}$. The proof combines a new (close to sharp) supersaturation version of the Erd\H{o}s-Simonovits stability theorem, the hypergraph container method, and a counting technique developed by Balogh, Bollob\'as and Simonovits.

Joint work with J\'ozsef Balogh, Neal Bushaw, Mauricio Collares Neto, Robert Morris, Maryam Sharifzadeh

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