Largest family without \(A \cup B \subseteq C \cap D\)

DOI10.1016/j.jcta.2005.01.002zbMath1070.05077arXivmath/0407373OpenAlexW1598800204MaRDI QIDQ2566811

Annalisa De Bonis, Konrad J. Swanepoel, Gyula O. H. Katona

Publication date: 28 September 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

SpernerLYMFamilies of subsets

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (38)

Intersecting \(P\)-free families ⋮ Forbidden induced subposets of given height ⋮ Largest family without a pair of posets on consecutive levels of the Boolean lattice ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Set Families With a Forbidden Induced Subposet ⋮ On Generalized Turán Results in Height Two Posets ⋮ Sperner type theorems with excluded subposets ⋮ Forbidden subposet problems with size restrictions ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) ⋮ No four subsets forming an \(N\) ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ The partition method for poset-free families ⋮ Diamond-free subsets in the linear lattices ⋮ Diamond-free families ⋮ Turán problems on non-uniform hypergraphs ⋮ On crown-free families of subsets ⋮ A note on the largest size of families of sets with a forbidden poset ⋮ Set families with forbidden subposets ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ On Families of Subsets With a Forbidden Subposet ⋮ Largest families without an \(r\)-fork ⋮ An improvement of the general bound on the largest family of subsets avoiding a subposet ⋮ Induced and non-induced forbidden subposet problems ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ Forbidding rank-preserving copies of a poset ⋮ Ramsey numbers for partially-ordered sets ⋮ Old and new applications of Katona's circle ⋮ On forbidden poset problems in the linear lattice ⋮ A simple proof for a forbidden subposet problem ⋮ Existence thresholds and Ramsey properties of random posets ⋮ Forbidden subposet problems in the grid ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ Avoiding brooms, forks, and butterflies in the linear lattices ⋮ Generalized forbidden subposet problems ⋮ Poset-free families and Lubell-boundedness ⋮ Abelian groups yield many large families for the diamond problem

Cites Work

• Unnamed Item
• A simple proof of the Erdős-Chao Ko-Rado theorem
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• On a lemma of Littlewood and Offord

This page was built for publication: Largest family without \(A \cup B \subseteq C \cap D\)