Poset matching---a distributive analog of independent matching

DOI10.1016/0012-365X(93)90380-CzbMath0783.05037MaRDI QIDQ685701

Uri N. Peled, Murali K. Srinivasan

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite posetmatchingstransversalmatroidposet matching algorithmposet matroids

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35) Transversal (matching) theory (05D15)

Related Items (3)

Matroids on convex geometries (cg-matroids) ⋮ Matroids on convex geometries: subclasses, operations, and optimization ⋮ Rank functions of strict cg-matroids

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

This page was built for publication: Poset matching---a distributive analog of independent matching