Abstract
An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is an ‘antipodal’ concept of matroid. We shall show that an antimatroid is derived from shelling of a poset if and only if it does not contain a minor isomorphic to S 7 where S 7 is the smallest semimodular lattice that is not modular. It is also shown that an antimatroid is a node-search antimatroid of a rooted digraph if and only if it does not contain a minor isomorphic to D 5 where D 5 is a lattice consisting of five elements ∅,{ x},{ y},{ x, y} and { x, y, z}. Furthermore, it is shown that an antimatroid is a node-search antimatroid of a rooted undirected graph if and only if it does not contain D 5 nor S 10 as minor: S 10 is a locally free lattice consisting of 10 elements.
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.
