On June 20, 2023, Guanghui Wang (王光辉) from Shandong University gave a talk at the Discrete Math Seminar on the maximum number of edges in uniformly dense hypergraphs with a forbidden subgraph. The title of his talk was “Embeddings in uniformly dense hypergraphs.”
An archetype problem in extremal combinatorics is to study the structure of subgraphs appearing in different classes of (hyper)graphs. We will focus on such embedding problems in uniformly dense hypergraphs. In precise, we will mention the uniform Turan density of some hypergraphs.