| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419351 | Discrete Applied Mathematics | 2014 | 5 Pages |
Abstract
Let AA be a family of subsets of an nn-set such that AA does not contain distinct sets AA and BB with |A∖B|=2|B∖A||A∖B|=2|B∖A|. How large can AA be? Our aim in this note is to determine the maximum size of such an AA. This answers a question of Kalai. We also give some related results and conjectures.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Imre Leader, Eoin Long,