2 problems

Füredi's conjecture. For every positive integer $n$, the Boolean lattice $2^{[n]}$ can be partitioned into $\binom{n}{\lfloor n/2\rfloor}$ chains such that the size of each chain i…

Hsu–Logan–Shahriari conjecture. If $Q$ is a rank-symmetric, unimodal normalized matching poset of width $w$, then $Q$ can be partitioned into $w$ chains, each chain in the partitio…