报告题目：Turan Problems on sparse hypergraphs

报告人：Tao Jiang  Miami University, USA

 

时间：1月6日 16：00-17：00

 

地点：1518

摘要：

Given a positive integer n and an r-uniform hypergraph H, the Turan number ex(n, H) is the largest size of an r-uniform hypergraph on n vertices that does not contain H as a subgraph. We will discuss Turan problems and results for r-uniform hypergraphs H whose Turan number ex(n, H) is on the order of O(n^{r-1} ). These include hypertrees, some regular hypergraphs, and etc. Some of these problems/results generalize classic problems/results on extremal set theory.