On $L$-close Sperner systems
Combinatorics
2020-04-09 v3
Abstract
For a set of positive integers, a set system is said to be -close Sperner, if for any pair of distinct sets in the skew distance belongs to . We reprove an extremal result of Boros, Gurvich, and Milani\v c on the maximum size of -close Sperner set systems for and generalize to and obtain slightly weaker bounds for arbitrary . We also consider the problem when 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 .
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}
}