Tilted Sperner families

DOI10.1016/J.DAM.2012.02.024MaRDI QIDQ2434734zbMATH OpenOpenAlexFDO

Authors Imre Leader, Eoin Long

Publication date 7 February 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.4151

zbMATH Keywords

extremal combinatoricsSperner families

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal combinatorics (05D99)

Abstract: 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 |AB| = 2|BA|. 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.

Recommendations

• A note on tilted Sperner families with patterns
• scientific article; zbMATH DE number 3946128
• All maximum 2-part Sperner families
• A generalization of Sperner's theorem for convex families
• Publication:3496336

Cites work

• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(7)

• Forbidding intersection patterns between layers of the cube
• Forbidding a set difference of size 1
• A note on tilted Sperner families with patterns
• The Eisenstein family
• Applications of graph containers in the Boolean lattice
• scientific article; zbMATH DE number 64155 (Why is no real title available?)
• Set families with a forbidden pattern

This page was built for publication: Tilted Sperner families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434734)