Abstract
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 a ’dual’ or ‘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 S7 where S7 is the smallest semimodular lattice that is not modular (See Fig. 1). It is also shown that an antimatroid is a node-search antimatroid of a digraph if and only if it does not contain a minor isomorphic to D5 where D5 is a lattice consisting of five elements O {x},{y}, {x, y} and {x, y, z}. Furthermore, an antimatroid is shown to be a node-search antimatroid of an undirected graph if and only if it does not contain D5 nor S10 as a minor: S10 is a locally free lattice consisting of ten elements shown in Fig. 2.
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.
