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
Publication date: 12 August 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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 Milaniv 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 .
Full work available at URL: https://arxiv.org/abs/1908.01744
Recommendations
- Sperner systems containing at most \(k\) sets of every cardinality
- New bounds on the maximum size of Sperner partition systems
- scientific article; zbMATH DE number 4108764
- All Maximum Size Two-Part Sperner Systems: In Short
- Families that remain \(k\)-Sperner even after omitting an element of their ground set
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems with geometric consequences
- Title not available (Why is that?)
- Bounding one-way differences
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- Title not available (Why is that?)
- \(l\)-trace \(k\)-Sperner families of sets
- Extremal Finite Set Theory
- Decomposing 1-Sperner hypergraphs
- Linear separation of connected dominating sets in graphs
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)