Geometries on partially ordered sets
From MaRDI portal
Publication:1238815
DOI10.1016/0095-8956(80)90054-4zbMath0359.05018OpenAlexW1965181542MaRDI QIDQ1238815
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90054-4
Related Items
Exchange properties of combinatorial closure spaces, Greedoid polyhedra, Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid, On a dependence relation in finite lattices, A converse to the Kurosh-Ore theorem, On the covering graph of balanced lattices, Matroids on convex geometries (cg-matroids), Extensions and duality of finite geometric closure operators, Projective Geometry on Partially Ordered Sets, The greedy algorithm for partially ordered sets, Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element, Hereditarily strong lattices, Greedy algorithms and poset matroids, Greedoids and searches in directed graphs, Dually atomistic lattices, Rank functions of strict cg-matroids, Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid, Consistent dually semimodular lattices, Poset matching---a distributive analog of independent matching, Polymatroid greedoids, Monge extensions of cooperation and communication structures, Strongness in semimodular lattices, The intersection of matroids and antimatroids, Geometries on partially ordered sets, Matroids on partially ordered sets, Optimal matchings in posets, An intersection theorem for supermatroids, A unifying approach to the structures of the stable matching problems, Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
Cites Work
