Most Probably Intersecting Hypergraphs

[摘要] The celebrated Erdős-Ko-Rado theorem shows that for $n \ge 2k$ the largest intersecting $k$-uniform set family on $[n]$ has size $\binom{n-1}{k-1}$. It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona intr

[学科分类] 离散数学和组合数学

[关键词] Extremal set theory;Erdős-Ko-Rado;Supersaturation;Intersecting families