2025.06.30 Colloquia Seminars
| Speaker |
Prof. Miklos Simonovits, Rényi Institute, Hungarian Academy of Sciences |
| Title |
Problems and Results in Extremal Graph Theory |
| Time |
2025.07.02 09:30-10:20 |
| Venue |
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. |
| Affiliation |
Miklós Simonovits，匈牙利Alfred Rényi数学研究所教授、匈牙利科学院院士、2014年匈牙利最高科学技术奖 Széchenyi奖获得者，主要研究兴趣为极值图论和随机图，是享誉国际的图论专家。Simonovits院士是上世纪世界著名数学家1983年沃尔夫奖获得者Paul Erdős的重要合作伙伴，与其合作发表论文21篇；同时是当今世界著名数学家2012年阿贝尔奖获得者Endre Szemerédi和2021年阿贝尔奖获得者László Lovász的重要合作伙伴，合作完成了诸多重要研究工作。 | |
