Abstract
Denote by l ∗(L) and l ∗(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 l ∗(L)<k< l ∗(L) there exists in L a maximal chain of length k. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
