Recommendations
Cites work
- \(Q _{2}\)-free families in the Boolean lattice
- 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\)
- Diamond-free families
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 3311781 (Why is no real title available?)
- Largest families without an \(r\)-fork
- Largest family without A B C D
- No four subsets forming an \(N\)
- On a lemma of Littlewood and Offord
- On diamond-free subposets of the Boolean lattice
- On families of subsets with a forbidden subposet
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- Set families with a forbidden subposet
- Three layer \(Q _{2}\)-free families in the Boolean lattice
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
Cited in
(8)- On diamond-free subposets of the Boolean lattice
- On forbidden poset problems in the linear lattice
- Abelian groups yield many large families for the diamond problem
- Zero-sum flows of the linear lattice.
- The covering lemma and q-analogues of extremal set theory problems
- 3-cluster-free families of subspaces
- Families of subsets without a given poset in double chains and Boolean lattices
- Avoiding brooms, forks, and butterflies in the linear lattices
This page was built for publication: Diamond-free subsets in the linear lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466889)
