Schedule

Extremal graph theory and extremal hypergraph theory are core areas of combinatorics. Extremal graph theory was basically started by Tur�n and was influenced greatly by the results of Paul Erd�s: in fact, it was among his favorite fields. Both areas, especially the theory of hypergraphs, have developed considerably since the publication of Bollob�s' excellent monograph "Extremal graph theory" (1978).

In this miniseries we are going to review the basics of Tur�n theory and point out connections to coding theory and other fields. Several open problems will be discussed during the lectures and in the afternoon seminars.

Organiser

Andr� K�ndgen, University of Toronto

Speakers and Tentative Talks

Zolt�n F�redi
University of Illinois, Urbana-Champaign and R�nyi Institute, Budapest

• New developments in the theory of bipartite Tur�n type problems
• Applications in coding theory and Ramsey theory
• Extremal problems on triple systems
• An overview of Erd�s' hypergraph problems

Mikl�s Simonovits
R�nyi Institute, Budapest and University of Memphis:

• Four proofs of Tur�n's graph theorem
• Asymptotic structure of extremal graphs
• Graphs of large girth, Ramanujan graphs
• Quasi random classes of graphs