Poset matching---a distributive analog of independent matching
From MaRDI portal
Publication:685701
DOI10.1016/0012-365X(93)90380-CzbMATH Open0783.05037MaRDI QIDQ685701FDOQ685701
Authors: Uri N. Peled, Murali K. Srinivasan 
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Transversal (matching) theory (05D15) Combinatorics of partially ordered sets (06A07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transversals and matroid partition
- Title not available (Why is that?)
- A weighted matroid intersection algorithm
- Matching Theory for Combinatorial Geometries
- Matroid Intersection
- The greedy algorithm for partially ordered sets
- Geometries on partially ordered sets
- Rado's theorem for polymatroids
- Independence Spaces and Combinatorial Problems
- An intersection theorem for supermatroids
- A matroid generalization of a theorem of Mendelsohn and Dulmage
- Dependence relations in a semi-modular lattice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal matchings in posets
Cited In (9)
- Optimal matchings in posets
- Antimatroids induced by matchings
- A note on order preserving matchings
- Matroids on convex geometries: subclasses, operations, and optimization
- $n!$ matchings, $n!$ posets
- Matroids on partially ordered sets
- Matroids on convex geometries (cg-matroids)
- Rank functions of strict cg-matroids
- On D-complementation
This page was built for publication: Poset matching---a distributive analog of independent matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685701)
