报告主题：An introduction to (nondegenerate) hypergraph Turán problems

报 告 人：刘西之

报告时间：2025年4月15日（周二）- 2025年4月19日（周六）上午10：00-11：30

报告地点：行知C403

报告摘要: Given a family F of r-graphs, what is the maximum number of edges in an F-free r-graph on n vertices? This fundamental problem in Extremal Combinatorics is known as the Turán problem. The case was asymptotically well-understood thanks to the celebrated Erdős-Stone Theorem from the 1960s. The case turns out to be much harder in general, and many natural cases remain wide open. In this minicourse, we will explore some basic tools for handling the hypergraph Turán problem, including its connection to other classical topics such as the Hajnal-Szemerédi Theorem, the Andrásfai-Erdős-Sós Theorem, and more.

报告人简介：刘西之，2018年本科毕业于中国科学技术大学，2022年博士毕业于University of Illinois at Chicago，导师Dhruv Mubayi。2022年至今在University of Warwick任博士后研究员。研究方向为极值组合，在Journal of Combinatorial Theory Series B，Combinatorica，Random Structures Algorithms，Journal of Graph Theory及European Journal of Combinatorics等国际权威期刊发表学术论文数篇。