- Series
- Graph Theory Seminar
- Time
- Tuesday, September 21, 2021 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Xizhi Liu – University of Illinois at Chicago – xliu246@uic.edu – http://homepages.math.uic.edu/~liu/
- Organizer
- Anton Bernshteyn
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.