Sperner type theorems with excluded subposets
From MaRDI portal
Publication:385154
DOI10.1016/J.DAM.2011.08.021zbMath1277.05160OpenAlexW2060279722MaRDI QIDQ385154
No author found.
Publication date: 29 November 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.021
Related Items (3)
Localized versions of extremal problems ⋮ Existence thresholds and Ramsey properties of random posets ⋮ Abelian groups yield many large families for the diamond problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diamond-free families
- \(Q _{2}\)-free families in the Boolean lattice
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
- An update on the middle levels problem
- Extremal properties of collections of subsets containing no two sets and their union
- An extremal problem with excluded subposet in the Boolean lattice
- Hamiltonian Kneser graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Set families with a forbidden subposet
- No four subsets forming an \(N\)
- Largest families without an \(r\)-fork
- Largest family without \(A \cup B \subseteq C \cap D\)
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- On Families of Subsets With a Forbidden Subposet
- 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: Sperner type theorems with excluded subposets
