期刊论文详细信息
Electronic Journal Of Combinatorics | |
Extremal Problems for Subset Divisors | |
Tony Huynh1  | |
关键词: extremal combinatorics; exact enumeration; | |
DOI : | |
学科分类:离散数学和组合数学 | |
来源: Electronic Journal Of Combinatorics | |
【 摘 要 】
Let $A$ be a set of $n$ positive integers. We say that a subset $B$ of $A$ is a divisor of $A$, if the sum of the elements in $B$ divides the sum of the elements in $A$. We are interested in the following extremal problem. For each $n$, what is the maximu
【 授权许可】
Others
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201909024213531ZK.pdf | 287KB | download |