1 problem

Matching

Asymptotic sharpness of the layered lower bound for Boolean-lattice chain covers
Less than 1 year old
Asymptotic sharpness conjecture. For every fixed $r\ge 1$ ,
openboolean-lattice chain-covers extremal-combinatorics
012