Poset matching---a distributive analog of independent matching
From MaRDI portal
Publication:685701
DOI10.1016/0012-365X(93)90380-CzbMath0783.05037MaRDI QIDQ685701
Murali K. Srinivasan, Uri N. Peled
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
06A07: Combinatorics of partially ordered sets
05B35: Combinatorial aspects of matroids and geometric lattices
05D15: Transversal (matching) theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal matchings in posets
- An intersection theorem for supermatroids
- The greedy algorithm for partially ordered sets
- Geometries on partially ordered sets
- A matroid generalization of a theorem of Mendelsohn and Dulmage
- Dependence relations in a semi-modular lattice
- Matroid Intersection
- A weighted matroid intersection algorithm
- Rado's theorem for polymatroids
- Transversals and matroid partition
- Independence Spaces and Combinatorial Problems
- Matching Theory for Combinatorial Geometries