The minimum of the antichains in the factor poset

Autor:	Chang, Gerard J., Hao, Fred H.
Zdroj:	Order; December 1987, Vol. 3 Issue: 4 p355-357, 3p
Abstrakt:	Denote g(m, n) the minimum of min A, where A is a subset of {1, 2, ..., m} of size n and there do not exist two distinct x and y in A such that x divides y. We use a method of poset to prove that g(m, n)=2i for positive integer i=log3m and 1+s(m, i-1)i
Databáze:	Supplemental Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink