Matching Theory for Combinatorial Geometries
From MaRDI portal
Publication:5622205
DOI10.2307/1995784zbMath0218.05013OpenAlexW4230783640MaRDI QIDQ5622205
Thomas A. Dowling, Martin Aigner
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/1995784
Transversal (matching) theory (05D15) Combinatorial geometries and geometric closure systems (51D20)
Related Items (7)
The popular matching and condensation problems under matroid constraints ⋮ Matroid Intersection under Restricted Oracles ⋮ Matroidal structure of rough sets based on serial and transitive relations ⋮ Poset matching---a distributive analog of independent matching ⋮ Bimatroids and invariants ⋮ Exact and approximation algorithms for weighted matroid intersection ⋮ Optimal matchings in posets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs and matching theorems
- Matching theorems for combinatorial geometries
- Applications of the notion of independence to problems of combinatorial analysis
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- Galois Connexions
- A THEOREM ON INDEPENDENCE RELATIONS
This page was built for publication: Matching Theory for Combinatorial Geometries
