Matching Theory for Combinatorial Geometries

DOI10.2307/1995784MaRDI QIDQ5622205zbMATH OpenOpenAlexFDO

Authors Martin Aigner, Thomas A. Dowling

Publication date 1971

Full work available at URL https://doi.org/10.2307/1995784

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Combinatorial geometries and geometric closure systems (51D20)

Cites work

• A THEOREM ON INDEPENDENCE RELATIONS
• Applications of the notion of independence to problems of combinatorial analysis
• Galois Connexions
• Graphs and matching theorems
• scientific article; zbMATH DE number 3144144 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Matching theorems for combinatorial geometries
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries

Cited in

(13)

• Bimatroids and invariants
• Matroidal structure of rough sets based on serial and transitive relations
• Exact and approximation algorithms for weighted matroid intersection
• The popular matching and condensation problems under matroid constraints
• Matroid Intersection under Restricted Oracles
• Fast algorithms via dynamic-oracle matroids
• Poset matching---a distributive analog of independent matching
• Adaptive sparsification for matroid intersection
• Faster matroid partition algorithms
• Breaking O(nr) for matroid intersection
• Deterministic (2/3-)-approximation of matroid intersection using nearly-linear independence-oracle queries
• A formal analysis of algorithms for matroids and greedoids
• Optimal matchings in posets

This page was built for publication: Matching Theory for Combinatorial Geometries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5622205)