报告题目：The feasible region of induced graphs
报告人：伊利诺伊大学芝加哥分校博士研究生，刘西之
报告时间: 2021年10月19日 09:30-12:00
报告地点：腾讯会议231 803 173
报告摘要：
Fix a graph F, a classical problem in extremal graph theory asks about how many induced copies of F can a graph with edge density \rho have? The only case in which we know the asymptotic solution is when F is a complete graph, and it was solved completely only recently by Reiher using the flag algebra machinery. We will consider the other cases and show some results when F is a complete bipartite graph or a complete graph minus one edge. Many interesting related open problems will also be introduced. Joint work with Dhruv Mubayi and Christian Reiher.
报告人简介：
刘西之，2018年本科毕业于中国科学技术大学，现为伊利诺伊大学芝加哥分校博士研究生，导师Dhruv Mubayi。研究方向为极值组合，在Journal of Combinatorial Theory Series B，Combinatorica，Random Structures Algorithms，Journal of Graph Theory及European Journal of Combinatorics等国际权威期刊发表学术论文近十篇。
