On the uniformity of the closed-set lattice of a tree (Q1076680)

Denote by \(\ell^*(L)\) and \(\ell_*(L)\) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with \(\ell *(L)<k<\ell^*(L)\) there exists in L a maximal chain of length k. In this paper, it is shown that the closed-set lattice of a finite graph G is uniform if G is a tree. The result is not necessarily true if G is not a tree.