Guanghui Wang (王光辉), Embeddings in uniformly dense hypergraphs
Room B332 IBS (기초과학연구원)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.