报告人：王星炜 (南开大学)

时间：2021年5月26日9:00开始

腾讯会议ID：255 706 396（无密码）

摘要:Chv\'{a}tal’s conjecture on the intersecting family of the faces of the simplicial complex is a long-standing problem in combinatorics. Snevily gave an affirmative answer to this conjecture for near-cone complex. Woodroofe gave Erd\H{o}s-Ko-Rado type theorem for near-cone complex by using algebraic shift method. Motivated by these results, we concerned with the restricted intersecting family for the simplicial complex and gave an upper bound for the cardinality of the restricted intersecting family of the faces of the simplicial complex. Applying our theorems to certain simplicial complex, we can deduce the upper bounds for the cardinalities of the restricted intersecting families of the independent set of the graph, the set partition, the $r$-separated sets and the King Arthur and his Knight Table.

简介:王星炜，南开大学组合数学中心，教授，2010年博士毕业于南开大学组合数学中心，师从陈永川院士，2017年到2018年访问美国Texas A&M University数学系。主要从事于分析组合学，代数组合学，极值集合论等领域的研究，在Trans. Amer. Math. Soc.，Math. Comp.，Pacific J. Math.，Proc. Amer. Math. Soc.，Proc. Royal. Soc. Edinb. A，Proc. Edinb. Math. Soc.，Adv. Appl. Math.， SIAM J. Discrete Math.等杂志发表论文20余篇。

邀请人：傅士硕

欢迎广大师生积极参与！