No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
Let $L$ be a finite distributive lattice. Let $\text{Su}{{\text{b}}_{0}}(L)$ be the lattice
and let ${{\ell }_{*}}[\text{Su}{{\text{b}}_{0}}(L)]$ be the length of the shortest maximal chain in $\text{Su}{{\text{b}}_{0}}(L)$. It is proved that if $K$ and $L$ are non-trivial finite distributive lattices, then
A conjecture from the 1984 Banff Conference on Graphs and Order is thus proved.