Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647061 | Discrete Mathematics | 2016 | 7 Pages |
Abstract
If s is a positive integer and A is a set of positive integers, we say that B is an s-divisor of A if âbâBbâ£sâaâAa. We study the maximal number of k-subsets of an n-element set that can be s-divisors. We provide a counterexample to a conjecture of Huynh that for s=1, the answer is (nâ1k) with only finitely many exceptions, but prove that adding a necessary condition makes this true. Moreover, we show that under a similar condition, the answer is (nâ1k) with only finitely many exceptions for each s.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Samuel Zbarsky,