Abstract

For a set LL of positive integers, a set system F⊆2[n]\mathcal{F} \subseteq 2^{[n]} is said to be LL-close Sperner, if for any pair F,GF,G of distinct sets in F\mathcal{F} the skew distance sd(F,G)=min⁡{∣F∖G∣,∣G∖F∣}sd(F,G)=\min\{|F\setminus G|,|G\setminus F|\} belongs to LL. We reprove an extremal result of Boros, Gurvich, and Milani\v c on the maximum size of LL-close Sperner set systems for L={1}L=\{1\} and generalize to ∣L∣=1|L|=1 and obtain slightly weaker bounds for arbitrary LL. We also consider the problem when LL might include 0 and reprove a theorem of Frankl, Füredi, and Pach on the size of largest set systems with all skew distances belonging to L={0,1}L=\{0,1\}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.