Matchings for linearly indecomposable modular lattices

DOI10.1016/0012-365X(87)90013-6zbMath0608.06007OpenAlexW2026201623WikidataQ126389231 ScholiaQ126389231MaRDI QIDQ1086266

Klaus Reuter

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90013-6

zbMATH Keywords

matchingfinite linearly indecomposable modular latticejoin irreduciblemeet irreducible

Mathematics Subject Classification ID

Modular lattices, Desarguesian lattices (06C05)

Related Items (4)

The pruning-grafting lattice of binary trees ⋮ Matchings In Three Catalan Lattices ⋮ The Kurosh-Ore exchange property ⋮ Three notes on distributive lattices

Cites Work

• Counting formulas for glued lattices
• Matchings and Radon transforms in lattices. I: Consistent lattices
• Combinatorial inequalities for semimodular lattices of breadth two
• Proof of a conjecture on finite modular lattices

This page was built for publication: Matchings for linearly indecomposable modular lattices