Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
From MaRDI portal
Publication:3509403
DOI10.1007/978-3-540-77200-2_6zbMath1155.05001MaRDI QIDQ3509403
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
set systems; Sperner's theorem; fork; brush; Lubell's counting method; maximal size of an antichain; set configuration
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05A05: Permutations, words, matrices
05D05: Extremal set theory
Related Items
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems, Sperner type theorems with excluded subposets, Diamond-free subsets in the linear lattices, Diamond-free families, Avoiding brooms, forks, and butterflies in the linear lattices, A simple proof for a forbidden subposet problem, Forbidding a set difference of size 1, A PROBLEM FOR ABELIAN GROUPS, On Families of Subsets With a Forbidden Subposet
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
