Two Characterizations of Antimatroids

DOI10.2478/V10157-012-0048-1MaRDI QIDQ5171247zbMATH OpenOpenAlexFDO

Authors Hua Mao

Publication date 26 July 2014

Published in Annals of the Alexandru Ioan Cuza University - Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/v10157-012-0048-1

zbMATH Keywords

\(k\)-truncated antimatroidantimatroidconvex geometryformal concept analysisNextClosure algorithm

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Axiomatic and generalized convexity (52A01) Combinatorics in computer science (68R05)

Recommendations

• Antimatroids of finite character
• An algorithmic characterization of antimatroids
• Correspondence between two antimatroid algorithmic characterizations
• Some characterization of infinite antimatroids
• A Geometric Characterization of Poly-antimatroids
• A circuit set characterization of antimatroids
• Antimatroids induced by matchings
• The intersection of matroids and antimatroids
• Antimatroids and balanced pairs
• Anti-matroids

Cited in

(5)

• Correspondence between two antimatroid algorithmic characterizations
• A single-element extension of antimatroids
• Antimatroids and balanced pairs
• An algorithmic characterization of antimatroids
• A Geometric Characterization of Poly-antimatroids

This page was built for publication: Two Characterizations of Antimatroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171247)