Sperner type theorems with excluded subposets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3845613 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- A short proof of Sperner's lemma
- An extremal problem with excluded subposet in the Boolean lattice
- An update on the middle levels problem
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
- Diamond-free families
- Extremal properties of collections of subsets containing no two sets and their union
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- Hamiltonian Kneser graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Largest families without an \(r\)-fork
- Largest family without \(A \cup B \subseteq C \cap D\)
- Lower bounds for constant weight codes
- No four subsets forming an \(N\)
- On a lemma of Littlewood and Offord
- On families of subsets with a forbidden subposet
- On generalized graphs
- Set families with a forbidden subposet
- \(Q _{2}\)-free families in the Boolean lattice
Cited in
(4)
This page was built for publication: Sperner type theorems with excluded subposets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385154)