Optimal matchings in posets

DOI10.1016/S0195-6698(83)80025-0zbMath0537.06003MaRDI QIDQ792355

Ulrich Faigle

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmlattice of subspacesdistributive supermatroidideals of posetslattice of closed idealsmatchable idealsoptimal matchings

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of matroids and geometric lattices (05B35) Lattice ideals, congruence relations (06B10) General theory of linear incidence geometry and projective geometries (51A05)

Related Items (1)

Poset matching---a distributive analog of independent matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The greedy algorithm for partially ordered sets
• Matching in modular lattices
• Geometries on partially ordered sets
• Proof of a conjecture on finite modular lattices
• Some Generalizations of the Problem of Distinct Representatives
• Rado's theorem for polymatroids
• Matching Theory for Combinatorial Geometries

This page was built for publication: Optimal matchings in posets