Excluded-minor characterizations of antimatroids arisen from posets and graph searches.

DOI10.1016/S0166-218X(02)00581-4zbMath1033.05025OpenAlexW2179527687MaRDI QIDQ1406042

D. Massart

Publication date: 9 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00581-4

zbMATH Keywords

antimatroidexcluded minornode searchposet shelling

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Antimatroids and balanced pairs ⋮ ULD-Lattices and Δ-Bonds ⋮ The max-flow min-cut property of two-dimensional affine convex geometries ⋮ Characterizations of the convex geometries arising from the double shellings of posets

Cites Work

• Matroids and antimatroids - a survey
• Greedoids
• The theory of convex geometries
• A characterization of undirected branching greedoids
• Meet-distributive lattices and the anti-exchange closure
• The lattice of convex sets of an oriented matroid
• The forbidden minor characterization of line-search antimatroids of rooted digraphs
• The subposet lattice and the order polynomial
• Convexity in Graphs and Hypergraphs
• The structure of Sperner k-families
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item