报告人:王健 (四川大学 副研究员)
报告时间:2026年11月21日下午15:00
报告地点:章辉楼442
联系人:石超
欢迎广大师生参加!
报告摘要:One of the central problems in extremal set theory is the determination of the maximum size of an $r$-wise $t$-intersecting $k$-graph on $n$ vertices. For $r=2$ after decades of effort, a complete solution was given by the Complete Intersection Theorem (\cite{AK0}). However the case $r\geq 3$ remains wide open. The $t$-star consisting of all $k$-sets containing a fixed $t$-set provides a lower bound. For $r=3$ and $k\geq t+2\geq44$, we determine the exact threshold for which it is optimal for $n>k$. The condition is essentially $n\geq \sqrt{t}k$. For $k\geq t+2\geq47$ and $n\geq\frac{\sqrt{4t+9}-1}{2}k$, we also establish the corresponding Hilton-Milner-type stability result. Joint work with Peter Frankl.
报告人简介:王健,现为四川大学副研究员,2016年博士毕业于南开大学组合数学中心,主要研究方向是极值组合学与极值集合论,在JCTA,JCTB,Combinatorica 等期刊发表论文多篇。