1 problem

Let $[n]=\{1,\ldots,n\}$, and let $f(n,k,n-l)$ denote the maximum size of an $(n-l)$-trace $k$-Sperner family in $2^{[n]}$. For positive integers $k,l$ with $l<k$, write…