Chain Covers in the Boolean Lattice

Zoltán Lóránt Nagy, Balázs Patkós

For integers $1\le r\le n+1$, let $N(n,r)$ denote the least number of chains in the Boolean lattice $B_n=2^{[n]}$ that cover every strict $r$-term chain. The case $r=1$ is the clas…