Title：Degree versions of the Erdos-Ko-Rado and Hilton-Milner Theorem

Spearker：黄皓 (Emory University)

Time：2017年6月13日（周二）   上午10:30-11:30

Room：东区管理科研楼  数学科学学院1418室

Abstract：In this talk, I will discuss the proof of a degree version of the celebrated Erd/H os-Ko-Rado theorem: given $n>2k$, for every intersecting $k$-uniform hypergraph $H$ on $n$ vertices, there exists a vertex that lies on at most $/binom{n-2}{k-2}$ edges. A degree version of the Hilton-Milner theorem was also
proved for sufficiently large $n$.