The minimum of the antichains in the factor poset
Journal
Order
Journal Volume
3
Journal Issue
4
Pages
355-357
Date Issued
1987
Author(s)
Abstract
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)
Type
journal article