论文部分内容阅读
Ko-Wei Lih曾猜测:含n个元素的集合的子集格的最大极小割具有2~(n-1)个元素,本文构造了一个反例,证明了此猜想不真。
Ko-Wei Lih has speculated that the maximal minima of a subset of a set containing n elements has 2 ~ (n-1) elements. This article constructs a counterexample and proves that this conjecture is not true.