Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)

DOI10.1007/s11083-008-9090-8zbMath1171.05051MaRDI QIDQ953271

Teena Carroll, Gyula O. H. Katona

Publication date: 17 November 2008

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-008-9090-8

zbMATH Keywords

forbidden subposet; extremal problem for families; Sperner type theorem

Mathematics Subject Classification ID

05D05: Extremal set theory

Related Items

Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems, Poset Ramsey numbers: large Boolean lattice versus a fixed poset, 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, Diamond-free families, Exact forbidden subposet results using chain decompositions of the cycle, Forbidden induced subposets of given height, A LYM inequality for induced posets, The partition method for poset-free families, Induced and non-induced forbidden subposet problems, A simple proof for a forbidden subposet problem, Abelian groups yield many large families for the diamond problem, Supersaturation, counting, and randomness in forbidden subposet problems, Set Families With a Forbidden Induced Subposet, Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method), On Families of Subsets With a Forbidden Subposet

Cites Work

• An extremal problem with excluded subposet in the Boolean lattice
• No four subsets forming an \(N\)
• Largest families without an \(r\)-fork
• Lower bounds for constant weight codes
• A short proof of Sperner's lemma
• On a lemma of Littlewood and Offord