Problems and Results in Extremal Graph Theory

Speaker: Prof. Miklos Simonovits, Rényi Institute, Hungarian Academy of Sciences

Inviter: 闫桂英 研究员

Title: Problems and Results in Extremal Graph Theory

Time & Venue: 2025.07.02  09:30-10:20  N205

Abstract: Extremal graph theory is one of the fastest developing area in Discrete Mathematics. Its 

importance comes partly from its beauty, partly from that it is connected to several other parts of 

Mathematics, and its results are applicable in many problems. An other reason why it is important is 

that with the increasing role of computers in our life the methods of combinatorics often helps in the 

theory of algorithms. I plan to speak of some difficult problems, conjectures of Extremal Graph Theory, 

and some central results, and its connection to those other areas. Some of these problems and conjectures 

are useful to know, since they provide some information about the important research areas in

 Combinatorics. I mention here four themes: (i) Stability phenomena. (ii) Regularity Lemma and its 

applications. (iii) Quasi-randomness. (iv) Random graphs and Extremal Graph Theory.