报告时间：2021年5月6日 15:00-16:30

报告地点：精正楼 301

报告人：上官冲教授 (山东大学)

报告摘要：For fixed integers r, v, e, an r-uniform hypergraph is called (v,e)-free if the union of e distinct edges of it contains at leaast v+1 vertices. What is the maximum number of edges of an r-uniform (v,e)-free hypergraph on n vertices? In this talk we will discuss this problem in the parameter regime v=er-(e-1)k. In particular, we will see how ideas from combinatorial design theory can be used to study this problem. 

(based on joint work with Itzhak Tamo, see JCTA 173 (2020) 105228)  

欢迎参加！

邀请人：汪馨、季利均