Bounds on maximal families of sets not containing three sets with A B C, A B
From MaRDI portal
(Redirected from Publication:953271)
Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
Recommendations
Cites work
Cited in
(26)- Diamond-free subsets in the linear lattices
- Set families with forbidden subposets
- No four subsets forming an \(N\)
- Largest family without \(A \cup B \subseteq C \cap D\)
- A simple proof for a forbidden subposet problem
- Turán problems on non-uniform hypergraphs
- Abelian groups yield many large families for the diamond problem
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- Poset Ramsey number \(R(P,Q_n)\). II: \(\mathrm{N}\)-shaped poset
- Poset Ramsey numbers: large Boolean lattice versus a fixed poset
- Forbidden induced subposets of given height
- Diamond-free families
- Linearity of cardinality for 3-nonlinked families of sets
- Three layer \(Q _{2}\)-free families in the Boolean lattice
- Sperner type theorems with excluded subposets
- On Cancellative Set Families
- On families of subsets with a forbidden subposet
- A LYM inequality for induced posets
- Induced and non-induced forbidden subposet problems
- On an extremal problem of set system
- Supersaturation, counting, and randomness in forbidden subposet problems
- A structural result for 3-graphs
- The partition method for poset-free families
- Set families with a forbidden induced subposet
- Exact forbidden subposet results using chain decompositions of the cycle
This page was built for publication: Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953271)
