A Deza–Frankl Type Theorem for Set Partitions

[摘要] A set partition of $[n]$ is a collection of pairwise disjoint nonempty subsets (called blocks) of $[n]$ whose union is $[n]$. Let $\mathcal{B}(n)$ denote the family of all set partitions of $[n]$. A family $\mathcal{A} \subseteq \mathcal{B}(n)$ is said to

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

[关键词] $t$-intersecting family;Deza-Frankl;Erdős-Ko-Rado;set partitions