solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看10889次
A class of non-matchable distributive lattices. (arXiv:1810.07332v1 [math.CO])
来源于:arXiv
The set of all perfect matchings of a plane (weakly) elementary bipartite
graph equipped with a partial order is a poset, moreover the poset is a finite
distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation
directed graph of the graph. A finite distributive lattice is matchable if its
Hasse diagram is isomorphic to a $Z$-transformation directed graph of a plane
weakly elementary bipartite graph, otherwise non-matchable. We introduce the
meet-irreducible cell with respect to a perfect matching of a plane (weakly)
elementary bipartite graph and give its equivalent characterizations. Using
these, we extend a result on non-matchable distributive lattices, and obtain a
class of new non-matchable distributive lattices. 查看全文>>