English

On $L$-close Sperner systems

Combinatorics 2020-04-09 v3

Abstract

For a set LL of positive integers, a set system F2[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{FG,GF}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\"uredi, and Pach on the size of largest set systems with all skew distances belonging to L={0,1}L=\{0,1\}.

Keywords

Cite

@article{arxiv.1908.01744,
  title  = {On $L$-close Sperner systems},
  author = {Daniel Nagy and Balazs Patkos},
  journal= {arXiv preprint arXiv:1908.01744},
  year   = {2020}
}