Erdős-Ko-Rado theorem and Hilton-Milner type theorem for $k$-partitions

Abstract

A $k$-partition of an $n$-set $X$ is a collection of $k$ pairwise disjoint non-empty subsets whose union is $X$. A family of $k$-partitions of $X$ is called $t$-intersecting if any two of its members share at least $t$ blocks. A $t$-intersecting family is trivial if every $k$-partition in it contains $t$ fixed blocks, and is non-trivial otherwise. In this paper, we first prove that, for $n\ge L(k,t):=(t+1)+(k-t+1)\cdot {\log }_2(t+1)(k-t+1)$, a $t$-intersecting family with maximum size must consist of all $k$-partitions containing $t$ fixed singletons. This improves the results given by Erdős and Székely (2000), and by Kupavskii (2023). We further determine the non-trivial $t$-intersecting families of $k$-partitions with maximum size for $n\ge 2L(k,t)$, which turn out to be natural analogs of the corresponding families for finite sets. In addition, we prove a stability result.