scientific article
From MaRDI portal
Publication:3346344
zbMath0553.05030MaRDI QIDQ3346344
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Axiomatic and generalized convexity (52A01) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Non-interval greedoids and the transposition property, Exchange properties of combinatorial closure spaces, Greedoid polyhedra, Convex geometries are extremal for the generalized Sauer-Shelah bound, Homotopy properties of greedoids, An algorithmic characterization of antimatroids, A characterization of undirected branching greedoids, Homomorphisms and Ramsey properties of antimatroids, A circuit set characterization of antimatroids, A representation of antimatroids by Horn rules and its application to educational systems, Countable ultrahomogeneous antimatroids of convex dimension 2, Excluded-minor characterizations of antimatroids arisen from posets and graph searches., Monge sequences, antimatroids, and the transportation problem with forbidden arcs, Greedoids and searches in directed graphs, A unified interpretation of several combinatorial dualities, The max-flow min-cut property of two-dimensional affine convex geometries, Functional dependencies in relational databases: A lattice point of view, The affine representation theorem for abstract convex geometries, Polymatroid greedoids, The intersection of matroids and antimatroids, An abstract duality, Matroids and antimatroids - a survey, Pruning processes and a new characterization of convex geometries, Exchange systems, Communication complexity and combinatorial lattice theory, Chip-firing games on graphs, Join-semidistributive lattices and convex geometries.
