The maximum number of subset divisors of a given size

From MaRDI portal
Publication:267196

DOI10.1016/J.DISC.2016.01.025zbMATH Open1333.05308arXiv1407.4720OpenAlexW2236049392MaRDI QIDQ267196FDOQ267196


Authors: Samuel Zbarsky Edit this on Wikidata


Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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 sumbinBbmidssumainAa. 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 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 with only finitely many exceptions for each s.


Full work available at URL: https://arxiv.org/abs/1407.4720




Recommendations




Cites Work


Cited In (3)





This page was built for publication: The maximum number of subset divisors of a given size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267196)