Matching in modular lattices

DOI10.1016/0097-3165(82)90047-4MaRDI QIDQ1161538zbMATH OpenOpenAlexFDO

Authors 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

complemented modular latticesfinite latticeglueingjoin irreduciblesmatchingmeet irreducibles

Mathematics Subject Classification ID

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

Cites work

• A rank inequality for finite geometric lattices
• Combinatorial inequalities for semimodular lattices of breadth two
• Dilworth's covering theorem for modular lattices: A simple proof
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3292551 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• Proof of a conjecture on finite modular lattices
• S-verklebte Summen von Verbänden
• The imbedding problem for modular lattices
• Whitney Number Inequalities for Geometric Lattices

Cited in

(5)

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

This page was built for publication: Matching in modular lattices

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