Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)

DOI10.1007/978-3-540-77200-2_6zbMath1155.05001OpenAlexW30212033MaRDI QIDQ3509403

No author found.

Publication date: 1 July 2008

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77200-2_6

zbMATH Keywords

set systemsSperner's theoremforkbrushLubell's counting methodmaximal size of an antichainset configuration

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (9)

Sperner type theorems with excluded subposets ⋮ Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems ⋮ A PROBLEM FOR ABELIAN GROUPS ⋮ Diamond-free subsets in the linear lattices ⋮ Forbidding a set difference of size 1 ⋮ Diamond-free families ⋮ On Families of Subsets With a Forbidden Subposet ⋮ A simple proof for a forbidden subposet problem ⋮ Avoiding brooms, forks, and butterflies in the linear lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
• An extremal problem with excluded subposet in the Boolean lattice
• No four subsets forming an \(N\)
• Largest families without an \(r\)-fork
• Largest family without \(A \cup B \subseteq C \cap D\)
• Logarithmic order of free distributive lattice
• Lower bounds for constant weight codes
• 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: Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)