2011/01/21 by Imre Leader, Leader, Imre, Eoin Long +1
Mathematics · #05D05 #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.1101.4151
openalex publication_date 2011/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.