Abstract
Let A be a family of subsets of an n-set such that A does not contain distinct sets A and B with |A\B| =2|B\A|. How large can A be? Our aim in this note is to determine the maximum size of such an A. This answers a question of Kalai. We also give some related results and conjectures.
Original language | English |
---|---|
Pages (from-to) | 194-198 |
Number of pages | 5 |
Journal | Discrete Applied Mathematics |
Volume | 163 |
Issue number | 2 |
Early online date | 7 Apr 2012 |
DOIs | |
Publication status | Published - 30 Jan 2014 |
Keywords
- Extremal combinatorics
- Sperner families