Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
From MaRDI portal
Recommendations
Cites work
- A short proof of Sperner's lemma
- An extremal problem with excluded subposet in the Boolean lattice
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- 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?)
- Largest families without an \(r\)-fork
- Largest family without A B C D
- Logarithmic order of free distributive lattice
- Lower bounds for constant weight codes
- No four subsets forming an \(N\)
- On a lemma of Littlewood and Offord
- On generalized graphs
Cited in
(14)- A simple proof for a forbidden subposet problem
- Forbidding a set difference of size 1
- Largest families without an \(r\)-fork
- A PROBLEM FOR ABELIAN GROUPS
- On families of subsets with a forbidden subposet
- Forbidden intersection patterns in the families of subsets
- Sperner type theorems with excluded subposets
- Diamond-free subsets in the linear lattices
- Set families with a forbidden pattern
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- Diamond-free families
- The asymptotic uniform distribution of subset sums
- Forbidden subposets in the cycle poset
- Avoiding brooms, forks, and butterflies in the linear lattices
This page was built for publication: Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3509403)