Counterexamples to the Balogh-Linz-Patkós Conjecture

A set system $\mathcal{F}$ is called $t$-intersecting if $\mathrm{\mid }A\cap B\mathrm{\mid }\ge t$ for every pair of sets $A,B\in \mathcal{F}\mathrm{.}$ A set system $\mathcal{F}$ is $k$-Sperner if it does not contain a chain of length $k+1$. Balogh, Linz and Patkós (Combinatorial Theory, 2023) conjectured an extremal result for $t$-intersecting $k$-Sperner families when $n+t$ is odd. In this note we give an explicit construction that is $t$-intersecting and $k$-Sperner, and whose size exceeds that of the conjectured fixed-star construction for infinitely many values of $n$. Consequently, we disprove the Balogh-Linz-Patkós conjecture for all $t\ge 2$ and $k\ge 2$ satisfying $k(t-1)\ge t+1$.