A size-width inequality for distributive lattices
For a finite distributive lattice L with an antichain of size \(w\geq 7\) it is shown that \(| L| \geq 3w\). The authors expect a lower bound of order w \(\sqrt{\log w}\). The minimal exceptional cases arise for \(w\leq 6\) from the Boolean algebras \(2^ n\) for \(0\leq n\leq 4\).
scientific article; zbMATH DE number 3959501