Matching in modular lattices

DOI10.1016/0097-3165(82)90047-4zbMath0479.06011OpenAlexW2091856878MaRDI QIDQ1161538

Dwight Duffus

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(82)90047-4

zbMATH Keywords

matchingfinite latticeglueingjoin irreduciblescomplemented modular latticesmeet irreducibles

Mathematics Subject Classification ID

Complemented lattices, orthocomplemented lattices and posets (06C15) Modular lattices, Desarguesian lattices (06C05)

Related Items (5)

Subdiagrams equal in number to their duals ⋮ The pruning-grafting lattice of binary trees ⋮ Matchings In Three Catalan Lattices ⋮ Optimal matchings in posets ⋮ Matchings and Radon transforms in lattices. I: Consistent lattices

Cites Work

• Combinatorial inequalities for semimodular lattices of breadth two
• Dilworth's covering theorem for modular lattices: A simple proof
• S-verklebte Summen von Verbänden
• Proof of a conjecture on finite modular lattices
• The imbedding problem for modular lattices
• Whitney Number Inequalities for Geometric Lattices
• A rank inequality for finite geometric lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching in modular lattices