Erdős-Ko-Rado theorems for uniform set-partition systems (Q2571283)

A set partition is uniform, if all class sizes are equal. Two set partitions are \(t\)-intersecting, if they have \(t\) classes in common. The paper finds the maximum number of pairwise \(t\)-intersecting uniform partitions of a set for \(t=1\), and under extra assumptions, also for \(t>1\). The optimal structure exhibits trivial \(t\)-intersection, i.e. \(t\) classes are common in all partitions in the family. This situation is analogous to the Erdős-Ko-Rado theorem on \(t\)-intersecting families of \(k\)-element subsets. \textit{R. Ahlswede} and \textit{L. H. Khachatrian} [Eur. J. Comb. 18, 125--136 (1997; Zbl 0869.05066)] determined the size and structure of all maximum size \(t\)-intersecting set systems of \(k\)-element sets. The paper proposes analogous conjectures for intersecting partitions.