Optimal matchings in posets

DOI10.1016/S0195-6698(83)80025-0zbMATH Open0537.06003MaRDI QIDQ792355FDOQ792355

U. 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching Theory for Combinatorial Geometries
• The greedy algorithm for partially ordered sets
• Geometries on partially ordered sets
• Rado's theorem for polymatroids
• Some Generalizations of the Problem of Distinct Representatives
• Proof of a conjecture on finite modular lattices
• Matching in modular lattices

Cited In (5)

• Optimal general matchings
• Title not available (Why is that?)
• Poset matching---a distributive analog of independent matching
• $n!$ matchings, $n!$ posets
• Computing Optimal Morse Matchings

This page was built for publication: Optimal matchings in posets

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