scientific article
From MaRDI portal
Publication:3346344
zbMATH Open0553.05030MaRDI QIDQ3346344FDOQ3346344
Publication date: 1984
Title of this publication is not available (Why is that?)
Combinatorial aspects of matroids and geometric lattices (05B35) Axiomatic and generalized convexity (52A01)
Cited In (28)
- An abstract duality
- Pruning processes and a new characterization of convex geometries
- Countable ultrahomogeneous antimatroids of convex dimension 2
- Chip-firing games on graphs
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- A characterization of undirected branching greedoids
- Homomorphisms and Ramsey properties of antimatroids
- Matroids and antimatroids - a survey
- Polymatroid greedoids
- The max-flow min-cut property of two-dimensional affine convex geometries
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- An algorithmic characterization of antimatroids
- Communication complexity and combinatorial lattice theory
- Convex geometries are extremal for the generalized Sauer-Shelah bound
- Join-semidistributive lattices and convex geometries.
- The intersection of matroids and antimatroids
- Exchange properties of combinatorial closure spaces
- Homotopy properties of greedoids
- Greedoids and searches in directed graphs
- Exchange systems
- Functional dependencies in relational databases: A lattice point of view
- A representation of antimatroids by Horn rules and its application to educational systems
- Title not available (Why is that?)
- The affine representation theorem for abstract convex geometries
- A unified interpretation of several combinatorial dualities
- Greedoid polyhedra
- Non-interval greedoids and the transposition property
- A circuit set characterization of antimatroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346344)
