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

From MaRDI portal
Publication:2566811


DOI10.1016/j.jcta.2005.01.002zbMath1070.05077arXivmath/0407373MaRDI 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


05D05: Extremal set theory


Related Items

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



Cites Work