Xizhi Liu, Hypergraph Turán problem: from 1 to ∞

One interesting difference between (nondegenerate) Graph Turán problem and Hypergraph Turán problem is that the hypergraph families can have at least two very different extremal constructions. In this talk, we will look at some recent progress and approaches to constructing hypergraph families with at least two different extremal constructions.
Based on some joint work with Dhruv Mubayi, Christian Reiher, Jianfeng Hou, Heng Li, and Yixiao Zhang.