Abstract
Let a be an element of a finite ordered set P. A subset F of P is a cutset for a if every element of F is incomparable to a and if every maximal chain of P intersects F ⊂ { a}. The cardinalities of minimum sized cutsets for elements of finite boolean lattices are determined
Sign-in/Register to access full text options 
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.
