
arXiv: 1101.4151
Let \cal A be a family of subsets of an n-set such that \cal A does not contain distinct sets A and B with |A\B| = 2|B\A|. How large can \cal A be? Our aim in this note is to determine the maximum size of such an \cal A. This answers a question of Kalai. We also give some related results and conjectures.
6 pages
05D05, Permutations, words, matrices, Sperner families, Extremal combinatorics, FOS: Mathematics, Mathematics - Combinatorics, extremal combinatorics, Combinatorics (math.CO)
05D05, Permutations, words, matrices, Sperner families, Extremal combinatorics, FOS: Mathematics, Mathematics - Combinatorics, extremal combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
