Paper Info
Title
Matching in modular lattices
Abstract
Let L be a finite lattice. A map f of the join irreducible elements of L to the meet irreducible elements of L is called a matching of L if f is one-to-one and x⩽f(x) for each join irreducible x. We investigate this conjecture: every finite modular lattice has a matching. The conjecture is verified for certain classes of modular lattices.
Year
DOI
Venue
1982
10.1016/0097-3165(82)90047-4
Journal of Combinatorial Theory, Series A
Field
DocType
Volume
Discrete mathematics,Combinatorics,Modular elliptic curve,Modular lattice,Lattice (order),Modular design,Conjecture,Mathematics
Journal
32
Issue
ISSN
Citations 
3
0097-3165
3
PageRank 
References 
Authors
0.49
0
1
Name
Order
Citations
PageRank
Dwight Duffus111136.63