On the sizes of t-intersecting k-chain-free families

DOI10.5070/C63261991MaRDI QIDQ6179322zbMATH OpenFDO

Authors József Balogh, Balázs Patkós

Publication date 16 December 2023

Published in Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theoryintersection theoremssperner families

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: A set system $mathcalF$ is $t$- extit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $mathcalF$ is $k$- extit{Sperner}, if it does not contain a chain of length $k+1$. Our main result is the following: Suppose that $k$ and $t$ are fixed positive integers, where $n+t$ is even with $tlen$ and $n$ is large enough. If $mathcalFsubseteq{2}^{[n]}$ is a $t$-intersecting $k$-Sperner family, then $|mathcalF|$ has size at most the size of the sum of $k$ layers, of sizes $(n+t)/2,ldots,(n+t)/2+k-1$. This bound is best possible. The case when $n+t$ is odd remains open.

Recommendations

• A universal bound concerning \(t\)-intersecting families
• On the average size of sets in intersecting Sperner families
• Analogues of Milner's theorem for families without long chains and of vector spaces
• Chain intersecting families

Cites work

• A Combinatorial Theorem on Systems of Sets
• Analogues of Milner's theorem for families without long chains and of vector spaces
• Canonical Antichains on the Circle and Applications
• Intersecting P-free families
• Intersection theorems for systems of finite sets
• On a lemma of Littlewood and Offord
• Profile polytopes of some classes of families

Cited in

(2)

• A note on the size of \(\mathscr{N}\)-free families
• A sharp threshold for a random version of Sperner's theorem

This page was built for publication: On the sizes of \(t\)-intersecting \(k\)-chain-free families

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