On L-close Sperner systems

From MaRDI portal
Publication:2045374

DOI10.1007/S00373-021-02280-2zbMATH Open1470.05158arXiv1908.01744OpenAlexW3131502430MaRDI QIDQ2045374FDOQ2045374


Authors: Dániel T. Nagy, Balázs Patkós Edit this on Wikidata


Publication date: 12 August 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: For a set L of positive integers, a set system mathcalFsubseteq2[n] is said to be L-close Sperner, if for any pair F,G of distinct sets in mathcalF the skew distance sd(F,G)=min|FsetminusG|,|GsetminusF| belongs to L. We reprove an extremal result of Boros, Gurvich, and Milaniv c on the maximum size of L-close Sperner set systems for L=1 and generalize to |L|=1 and obtain slightly weaker bounds for arbitrary L. We also consider the problem when L 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.


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




Recommendations




Cites Work


Cited In (2)





This page was built for publication: On \(L\)-close Sperner systems

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